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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 13K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:13 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-d0m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654774250996

Running Version 202205111006
[2022-06-09 11:30:52] [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:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:30:52] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2022-06-09 11:30:52] [INFO ] Transformed 553 places.
[2022-06-09 11:30:52] [INFO ] Transformed 150 transitions.
[2022-06-09 11:30:52] [INFO ] Parsed PT model containing 553 places and 150 transitions in 206 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 3 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 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 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 33 place count 87 transition count 117
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 87 transition count 117
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 83 transition count 113
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 83 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 83 transition count 111
Applied a total of 58 rules in 20 ms. Remains 83 /109 variables (removed 26) and now considering 111/150 (removed 39) transitions.
// Phase 1: matrix 111 rows 83 cols
[2022-06-09 11:30:52] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-09 11:30:52] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 111 rows 83 cols
[2022-06-09 11:30:52] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 11:30:52] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 11:30:52] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
// Phase 1: matrix 111 rows 83 cols
[2022-06-09 11:30:52] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-09 11:30:53] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/109 places, 111/150 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/109 places, 111/150 transitions.
Support contains 32 out of 83 places after structural reductions.
[2022-06-09 11:30:53] [INFO ] Flatten gal took : 37 ms
[2022-06-09 11:30:53] [INFO ] Flatten gal took : 15 ms
[2022-06-09 11:30:53] [INFO ] Input system was already deterministic with 111 transitions.
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 28) seen :11
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 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 57 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 111 rows 83 cols
[2022-06-09 11:30:54] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 11:30:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:30:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:54] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-06-09 11:30:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:30:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:54] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-06-09 11:30:54] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-06-09 11:30:54] [INFO ] After 218ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-06-09 11:30:55] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 193 ms.
[2022-06-09 11:30:55] [INFO ] After 1028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 3 properties in 124 ms.
Support contains 16 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 80 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 104
Applied a total of 6 rules in 22 ms. Remains 80 /83 variables (removed 3) and now considering 104/111 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/83 places, 104/111 transitions.
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 515 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 527 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 520 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Finished probabilistic random walk after 15018 steps, run visited all 12 properties in 110 ms. (steps per millisecond=136 )
Probabilistic random walk after 15018 steps, saw 6478 distinct states, run finished after 110 ms. (steps per millisecond=136 ) properties seen :12
Computed a total of 6 stabilizing places and 6 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((X(p1)&&G(p2)))&&p0))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 73 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 67 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 65 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 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 46 place count 62 transition count 72
Applied a total of 46 rules in 21 ms. Remains 62 /83 variables (removed 21) and now considering 72/111 (removed 39) transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:57] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:30:57] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:57] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:30:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/83 places, 72/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/83 places, 72/111 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s54 1)), p2:(OR (AND (GEQ s22 1) (GEQ s41 1)) (AND (GEQ s1 1) (GEQ s54 1))), p1:(AND (GEQ s1 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-00 finished in 733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!X(!p0) U G((F(G(p1))||p2)))||F(p3))))'
Support contains 8 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 75 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 75 transition count 92
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 68 transition count 85
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 65 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 60 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 51 place count 60 transition count 68
Applied a total of 51 rules in 14 ms. Remains 60 /83 variables (removed 23) and now considering 68/111 (removed 43) transitions.
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:30:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:58] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:30:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:58] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:30:58] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:30:58] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 11:30:58] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/83 places, 68/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/83 places, 68/111 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p3)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s9 1) (GEQ s45 1)), p3:(AND (GEQ s2 1) (GEQ s58 1)), p0:(AND (GEQ s8 1) (GEQ s44 1)), p1:(AND (GEQ s5 1) (GEQ s22 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-01 finished in 527 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F((p0 U p1))||p0)))&&!(!X(p2) U p1)))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 74 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 74 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 74 transition count 89
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 67 transition count 82
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 66 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 65 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 65 transition count 79
Applied a total of 37 rules in 17 ms. Remains 65 /83 variables (removed 18) and now considering 79/111 (removed 32) transitions.
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:30:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:58] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:30:58] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 11:30:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-09 11:30:58] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:30:58] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:30:58] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/83 places, 79/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/83 places, 79/111 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) p1), true, (OR (AND (NOT p0) (NOT p1)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p2)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s64 1)), p2:(AND (GEQ s1 1) (GEQ s54 1)), p0:(AND (GEQ s1 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-02 finished in 439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&X(p1)) U G(p0)))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 73 transition count 88
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 66 transition count 81
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 58 transition count 64
Applied a total of 56 rules in 16 ms. Remains 58 /83 variables (removed 25) and now considering 64/111 (removed 47) transitions.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:30:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:59] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:30:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:30:59] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:30:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:59] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/83 places, 64/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/83 places, 64/111 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s10 1) (GEQ s46 1)), p1:(AND (GEQ s1 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-03 finished in 316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G((G(p1) U p2))&&p0)))))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 75 transition count 93
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 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 17 place count 75 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 70 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 69 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 69 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 69 transition count 84
Applied a total of 30 rules in 7 ms. Remains 69 /83 variables (removed 14) and now considering 84/111 (removed 27) transitions.
// Phase 1: matrix 84 rows 69 cols
[2022-06-09 11:30:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:59] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 84 rows 69 cols
[2022-06-09 11:30:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:59] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-09 11:30:59] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 69 cols
[2022-06-09 11:30:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:59] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/83 places, 84/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/83 places, 84/111 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=6 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s66 1)), p2:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s1 1) (GEQ s66 1))], nbAcceptance=2, 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-d0m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-04 finished in 664 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!(!p0 U p1))||!p0) U p2))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 74 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 74 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 74 transition count 89
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 68 transition count 83
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 66 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 63 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 44 place count 63 transition count 73
Applied a total of 44 rules in 6 ms. Remains 63 /83 variables (removed 20) and now considering 73/111 (removed 38) transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:31:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:31:00] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:31:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:31:00] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:31:00] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:31:00] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/83 places, 73/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/83 places, 73/111 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), p1, true]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s59 1)), p0:(AND (GEQ s1 1) (GEQ s32 1)), p1:(AND (GEQ s1 1) (GEQ s32 1) (GEQ s1 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-05 finished in 310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 73 transition count 88
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 66 transition count 81
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 58 transition count 64
Applied a total of 56 rules in 25 ms. Remains 58 /83 variables (removed 25) and now considering 64/111 (removed 47) transitions.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:31:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:00] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:31:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:31:00] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-06-09 11:31:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:31:00] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:31:00] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/83 places, 64/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/83 places, 64/111 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s50 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 4 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-06 finished in 248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||F(p1)))||G(F(p2))))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 75 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 75 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 75 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 70 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 69 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 68 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 67 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 67 transition count 80
Applied a total of 36 rules in 15 ms. Remains 67 /83 variables (removed 16) and now considering 80/111 (removed 31) transitions.
// Phase 1: matrix 80 rows 67 cols
[2022-06-09 11:31:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:00] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 80 rows 67 cols
[2022-06-09 11:31:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:00] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-09 11:31:00] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2022-06-09 11:31:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 67 cols
[2022-06-09 11:31:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:00] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/83 places, 80/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/83 places, 80/111 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s61 1)) (OR (LT s1 1) (LT s65 1))), p1:(OR (LT s1 1) (LT s61 1)), p2:(AND (GEQ s1 1) (GEQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23059 reset in 264 ms.
Product exploration explored 100000 steps with 23031 reset in 163 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 289 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 520 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 539 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Probably explored full state space saw : 5706 states, properties seen :3
Probabilistic random walk after 13857 steps, saw 5706 distinct states, run finished after 100 ms. (steps per millisecond=138 ) properties seen :3
Explored full state space saw : 5741 states, properties seen :0
Exhaustive walk after 13892 steps, saw 5741 distinct states, run finished after 66 ms. (steps per millisecond=210 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 381 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Applied a total of 0 rules in 8 ms. Remains 67 /67 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 67 cols
[2022-06-09 11:31:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:03] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 80 rows 67 cols
[2022-06-09 11:31:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:31:03] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-09 11:31:03] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-06-09 11:31:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 67 cols
[2022-06-09 11:31:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:03] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 80/80 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 p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 536 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4095 steps, run visited all 1 properties in 14 ms. (steps per millisecond=292 )
Probabilistic random walk after 4095 steps, saw 1841 distinct states, run finished after 14 ms. (steps per millisecond=292 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22926 reset in 106 ms.
Product exploration explored 100000 steps with 22841 reset in 195 ms.
Built C files in :
/tmp/ltsmin3735638729384015563
[2022-06-09 11:31:04] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-06-09 11:31:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:31:04] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-06-09 11:31:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:31:04] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-06-09 11:31:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:31:04] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3735638729384015563
Running compilation step : cd /tmp/ltsmin3735638729384015563;'/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 296 ms.
Running link step : cd /tmp/ltsmin3735638729384015563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3735638729384015563;'/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/stateBased61619233834616770.hoa' '--buchi-type=spotba'
LTSmin run took 310 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-07 finished in 4296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&p1)))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 74 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 74 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 19 place count 74 transition count 93
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 67 transition count 86
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 64 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 62 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 60 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 60 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 50 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 59 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 59 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 54 place count 59 transition count 69
Applied a total of 54 rules in 7 ms. Remains 59 /83 variables (removed 24) and now considering 69/111 (removed 42) transitions.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:31:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:05] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:31:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:31:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:31:05] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:31:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:31:05] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/83 places, 69/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/83 places, 69/111 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s23 1)), p1:(OR (AND (GEQ s1 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s23 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-10 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 74 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 74 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 74 transition count 89
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 69 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 67 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 66 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 64 transition count 74
Applied a total of 42 rules in 21 ms. Remains 64 /83 variables (removed 19) and now considering 74/111 (removed 37) transitions.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:31:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:05] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:31:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:31:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:31:05] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-09 11:31:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 11:31:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:31:05] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/83 places, 74/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/83 places, 74/111 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-12 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 74 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 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 19 place count 74 transition count 91
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 68 transition count 85
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 66 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 65 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 64 transition count 75
Applied a total of 42 rules in 8 ms. Remains 64 /83 variables (removed 19) and now considering 75/111 (removed 36) transitions.
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:31:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:05] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:31:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:31:05] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-06-09 11:31:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:31:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:05] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/83 places, 75/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/83 places, 75/111 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s62 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 22901 reset in 126 ms.
Product exploration explored 100000 steps with 22992 reset in 133 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 126 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 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5740 steps, run visited all 1 properties in 14 ms. (steps per millisecond=410 )
Probabilistic random walk after 5740 steps, saw 2555 distinct states, run finished after 14 ms. (steps per millisecond=410 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:31:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:06] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:31:06] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:31:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:31:06] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2022-06-09 11:31:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:31:06] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:31:06] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 75/75 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 88 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 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5740 steps, run visited all 1 properties in 25 ms. (steps per millisecond=229 )
Probabilistic random walk after 5740 steps, saw 2555 distinct states, run finished after 25 ms. (steps per millisecond=229 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22943 reset in 96 ms.
Product exploration explored 100000 steps with 23165 reset in 98 ms.
Built C files in :
/tmp/ltsmin16023718599249841113
[2022-06-09 11:31:07] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2022-06-09 11:31:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:31:07] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2022-06-09 11:31:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:31:07] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2022-06-09 11:31:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:31:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16023718599249841113
Running compilation step : cd /tmp/ltsmin16023718599249841113;'/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 186 ms.
Running link step : cd /tmp/ltsmin16023718599249841113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16023718599249841113;'/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/stateBased15945868039565110301.hoa' '--buchi-type=spotba'
LTSmin run took 131 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-13 finished in 2430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 74 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 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 19 place count 74 transition count 91
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 68 transition count 85
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 66 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 65 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 64 transition count 75
Applied a total of 42 rules in 4 ms. Remains 64 /83 variables (removed 19) and now considering 75/111 (removed 36) transitions.
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:31:07] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:31:08] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:31:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:31:08] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:31:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:31:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/83 places, 75/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/83 places, 75/111 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s1 1) (LT s62 1)) (OR (LT s1 1) (LT s32 1))), p1:(OR (LT s1 1) (LT s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 49459 steps with 11278 reset in 71 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-14 finished in 415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(p0) U (X(G(p2))&&X(p3)&&p1)))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 76 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 73 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 73 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 72 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 72 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 71 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 71 transition count 87
Applied a total of 26 rules in 3 ms. Remains 71 /83 variables (removed 12) and now considering 87/111 (removed 24) transitions.
// Phase 1: matrix 87 rows 71 cols
[2022-06-09 11:31:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:08] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 87 rows 71 cols
[2022-06-09 11:31:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:31:08] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 11:31:08] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 71 cols
[2022-06-09 11:31:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:31:08] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/83 places, 87/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 71/83 places, 87/111 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), p0, (OR (NOT p3) (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (NOT p2), (AND p0 p1 (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p0 (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 p0 (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p3 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p3 p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p1 p0 (NOT p3)) (AND p1 p0 (NOT p2))), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s67 1)), p0:(AND (GEQ s25 1) (GEQ s45 1)), p3:(AND (GEQ s1 1) (GEQ s65 1)), p2:(AND (GEQ s1 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-15 finished in 565 ms.
All properties solved by simple procedures.
Total runtime 16753 ms.

BK_STOP 1654774269033

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

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