Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716324368017

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 20:46:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:46:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:46:09] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-21 20:46:09] [INFO ] Transformed 553 places.
[2024-05-21 20:46:09] [INFO ] Transformed 150 transitions.
[2024-05-21 20:46:09] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 121
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 87 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 87 transition count 118
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 82 transition count 113
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 82 transition count 113
Applied a total of 61 rules in 21 ms. Remains 82 /109 variables (removed 27) and now considering 113/150 (removed 37) transitions.
// Phase 1: matrix 113 rows 82 cols
[2024-05-21 20:46:10] [INFO ] Computed 2 invariants in 12 ms
[2024-05-21 20:46:10] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 20:46:10] [INFO ] Invariant cache hit.
[2024-05-21 20:46:10] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 20:46:10] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-21 20:46:10] [INFO ] Invariant cache hit.
[2024-05-21 20:46:10] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 113/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 82/109 places, 113/150 transitions.
Support contains 26 out of 82 places after structural reductions.
[2024-05-21 20:46:10] [INFO ] Flatten gal took : 26 ms
[2024-05-21 20:46:10] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:46:10] [INFO ] Input system was already deterministic with 113 transitions.
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 27) seen :12
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-21 20:46:11] [INFO ] Invariant cache hit.
[2024-05-21 20:46:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:46:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:46:11] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:11
[2024-05-21 20:46:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:46:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:46:12] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2024-05-21 20:46:12] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 20:46:12] [INFO ] After 164ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :2 sat :11
[2024-05-21 20:46:12] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-21 20:46:12] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 13 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 113/113 transitions.
Graph (complete) has 239 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 78 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 78 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 77 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 77 transition count 102
Applied a total of 10 rules in 28 ms. Remains 77 /82 variables (removed 5) and now considering 102/113 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 77/82 places, 102/113 transitions.
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1038 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 102 rows 77 cols
[2024-05-21 20:46:13] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 20:46:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:46:13] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-21 20:46:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:46:14] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-21 20:46:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 20:46:14] [INFO ] After 86ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-21 20:46:14] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-21 20:46:14] [INFO ] After 448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 58 ms.
Support contains 12 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 76 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 75 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 75 transition count 98
Applied a total of 4 rules in 19 ms. Remains 75 /77 variables (removed 2) and now considering 98/102 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 75/77 places, 98/102 transitions.
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 983 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 547 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 537 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 518 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 994 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Finished probabilistic random walk after 20371 steps, run visited all 9 properties in 109 ms. (steps per millisecond=186 )
Probabilistic random walk after 20371 steps, saw 9125 distinct states, run finished after 113 ms. (steps per millisecond=180 ) properties seen :9
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 269 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U p1)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 74 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 74 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 69 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 68 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 67 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 81
Applied a total of 32 rules in 14 ms. Remains 67 /82 variables (removed 15) and now considering 81/113 (removed 32) transitions.
// Phase 1: matrix 81 rows 67 cols
[2024-05-21 20:46:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:46:15] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:46:15] [INFO ] Invariant cache hit.
[2024-05-21 20:46:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 20:46:15] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-21 20:46:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:46:15] [INFO ] Invariant cache hit.
[2024-05-21 20:46:16] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/82 places, 81/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 67/82 places, 81/113 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 209 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s24 1) (GEQ s38 1)), p0:(AND (GEQ s1 1) (GEQ s62 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-00 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G((F(p1)&&F(G(p2))))))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 64 transition count 80
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 64 transition count 80
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 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 60 transition count 70
Applied a total of 49 rules in 15 ms. Remains 60 /82 variables (removed 22) and now considering 70/113 (removed 43) transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 20:46:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:46:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:46:16] [INFO ] Invariant cache hit.
[2024-05-21 20:46:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:46:16] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-21 20:46:16] [INFO ] Invariant cache hit.
[2024-05-21 20:46:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 70/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 60/82 places, 70/113 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s53 1)), p1:(OR (LT s1 1) (LT s54 1)), p2:(AND (GEQ s6 1) (GEQ s43 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-d0m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-01 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 65 transition count 79
Iterating global reduction 1 with 2 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 1 with 1 rules applied. Total rules applied 37 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 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 41 place count 64 transition count 75
Applied a total of 41 rules in 20 ms. Remains 64 /82 variables (removed 18) and now considering 75/113 (removed 38) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-21 20:46:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:46:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:46:16] [INFO ] Invariant cache hit.
[2024-05-21 20:46:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:46:16] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-21 20:46:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:46:16] [INFO ] Invariant cache hit.
[2024-05-21 20:46:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 75/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 64/82 places, 75/113 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1) (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-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-02 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||((!p0 U (G(!p0)||(!p0&&G((!p1||G(!p2))))))&&X(F(!p3)))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 74 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 74 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 66 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 64 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 64 transition count 78
Applied a total of 40 rules in 11 ms. Remains 64 /82 variables (removed 18) and now considering 78/113 (removed 35) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 20:46:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:46:17] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 20:46:17] [INFO ] Invariant cache hit.
[2024-05-21 20:46:17] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 20:46:17] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-21 20:46:17] [INFO ] Invariant cache hit.
[2024-05-21 20:46:17] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 78/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 64/82 places, 78/113 transitions.
Stuttering acceptance computed with spot in 389 ms :[p0, true, (AND p3 p0), (AND p2 p1 p0), (AND p0 p2), p0, p3, p2, (AND p2 p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}], [{ cond=p3, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 1}, { cond=(NOT p2), acceptance={} source=7 dest: 7}], [{ cond=(AND p1 p2), acceptance={} source=8 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(NOT p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s24 1)), p1:(AND (GEQ s1 1) (GEQ s60 1)), p2:(AND (GEQ s1 1) (GEQ s43 1)), p3:(AND (GEQ s1 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31308 reset in 293 ms.
Product exploration explored 100000 steps with 31522 reset in 191 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 130 ms. Reduced automaton from 9 states, 29 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, p2, (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 20:46:18] [INFO ] Invariant cache hit.
[2024-05-21 20:46:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:46:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:46:18] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 20:46:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:46:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:46:18] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-21 20:46:18] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 20:46:18] [INFO ] After 18ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-21 20:46:18] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-21 20:46:18] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Graph (complete) has 190 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 77
Applied a total of 2 rules in 8 ms. Remains 63 /64 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 63/64 places, 77/78 transitions.
Incomplete random walk after 10000 steps, including 2321 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7061 steps, run visited all 2 properties in 46 ms. (steps per millisecond=153 )
Probabilistic random walk after 7061 steps, saw 3138 distinct states, run finished after 46 ms. (steps per millisecond=153 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F p1), (F p2), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 30 factoid took 304 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 83 ms :[true, p2, (AND p2 p1)]
Support contains 3 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 7 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 20:46:19] [INFO ] Invariant cache hit.
[2024-05-21 20:46:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 20:46:19] [INFO ] Invariant cache hit.
[2024-05-21 20:46:19] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 20:46:19] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-21 20:46:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:46:19] [INFO ] Invariant cache hit.
[2024-05-21 20:46:19] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 64/64 places, 78/78 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[true, p2, (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 534 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 20:46:20] [INFO ] Invariant cache hit.
[2024-05-21 20:46:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:46:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:46:20] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 20:46:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:46:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:46:20] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-21 20:46:20] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 20:46:20] [INFO ] After 20ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-21 20:46:20] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-21 20:46:20] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Graph (complete) has 190 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 77
Applied a total of 2 rules in 15 ms. Remains 63 /64 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 63/64 places, 77/78 transitions.
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7061 steps, run visited all 2 properties in 37 ms. (steps per millisecond=190 )
Probabilistic random walk after 7061 steps, saw 3138 distinct states, run finished after 38 ms. (steps per millisecond=185 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (AND (NOT p2) p1))]
Knowledge based reduction with 11 factoid took 242 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND p2 p1), p2]
Stuttering acceptance computed with spot in 80 ms :[true, (AND p2 p1), p2]
Stuttering acceptance computed with spot in 87 ms :[true, (AND p2 p1), p2]
Product exploration explored 100000 steps with 22868 reset in 132 ms.
Product exploration explored 100000 steps with 22755 reset in 190 ms.
Built C files in :
/tmp/ltsmin17890857890747291769
[2024-05-21 20:46:21] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-21 20:46:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:46:21] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-21 20:46:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:46:21] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-21 20:46:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:46:21] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17890857890747291769
Running compilation step : cd /tmp/ltsmin17890857890747291769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 295 ms.
Running link step : cd /tmp/ltsmin17890857890747291769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17890857890747291769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6687074021234646276.hoa' '--buchi-type=spotba'
LTSmin run took 286 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-03 finished in 5198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((F(p1) U p2)&&p0) U p3)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 75 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 75 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 71 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 71 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 68 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 67 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 67 transition count 82
Applied a total of 33 rules in 4 ms. Remains 67 /82 variables (removed 15) and now considering 82/113 (removed 31) transitions.
// Phase 1: matrix 82 rows 67 cols
[2024-05-21 20:46:22] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:46:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 20:46:22] [INFO ] Invariant cache hit.
[2024-05-21 20:46:22] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 20:46:22] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-21 20:46:22] [INFO ] Invariant cache hit.
[2024-05-21 20:46:22] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/82 places, 82/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 67/82 places, 82/113 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p3), (NOT p3), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s58 1)), p0:(AND (NOT (AND (GEQ s1 1) (GEQ s60 1))) (GEQ s1 1) (GEQ s64 1)), p2:(AND (GEQ s1 1) (GEQ s64 1)), p1:(AND (GEQ s1 1) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-09 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 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 45 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 61 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 60 transition count 70
Iterating global reduction 3 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 3 with 2 rules applied. Total rules applied 51 place count 60 transition count 68
Applied a total of 51 rules in 4 ms. Remains 60 /82 variables (removed 22) and now considering 68/113 (removed 45) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 20:46:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:46:22] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 20:46:22] [INFO ] Invariant cache hit.
[2024-05-21 20:46:22] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 20:46:22] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-21 20:46:22] [INFO ] Invariant cache hit.
[2024-05-21 20:46:22] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 68/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 60/82 places, 68/113 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s50 1) (AND (GEQ s1 1) (GEQ s56 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-10 finished in 612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1 U X(p2))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 62 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 62 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 62 transition count 73
Applied a total of 44 rules in 3 ms. Remains 62 /82 variables (removed 20) and now considering 73/113 (removed 40) transitions.
// Phase 1: matrix 73 rows 62 cols
[2024-05-21 20:46:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:46:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 20:46:23] [INFO ] Invariant cache hit.
[2024-05-21 20:46:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:46:23] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-21 20:46:23] [INFO ] Invariant cache hit.
[2024-05-21 20:46:23] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/82 places, 73/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 62/82 places, 73/113 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s50 1)), p0:(AND (GEQ s1 1) (GEQ s52 1)), p2:(AND (GEQ s1 1) (GEQ s57 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-11 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U G(((p2||F(p3))&&p1))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 74 transition count 97
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 74 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 69 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 69 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 68 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 68 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 68 transition count 87
Applied a total of 31 rules in 7 ms. Remains 68 /82 variables (removed 14) and now considering 87/113 (removed 26) transitions.
// Phase 1: matrix 87 rows 68 cols
[2024-05-21 20:46:23] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:46:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 20:46:23] [INFO ] Invariant cache hit.
[2024-05-21 20:46:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 20:46:23] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-21 20:46:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:46:23] [INFO ] Invariant cache hit.
[2024-05-21 20:46:23] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/82 places, 87/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 68/82 places, 87/113 transitions.
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (AND p1 p0), (NOT p3), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p3) p1 p0 p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p2 (NOT p3) p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={} source=6 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=7 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s65 1)), p0:(AND (GEQ s1 1) (GEQ s45 1)), p2:(GEQ s67 1), p3:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 52 steps with 20 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-12 finished in 696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X((G(F(p2))||p1))))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 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 49 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 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 55 place count 58 transition count 64
Applied a total of 55 rules in 2 ms. Remains 58 /82 variables (removed 24) and now considering 64/113 (removed 49) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 20:46:24] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:46:24] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:46:24] [INFO ] Invariant cache hit.
[2024-05-21 20:46:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:46:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-21 20:46:24] [INFO ] Invariant cache hit.
[2024-05-21 20:46:24] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/82 places, 64/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 58/82 places, 64/113 transitions.
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s47 1)), p1:(OR (LT s1 1) (LT s50 1)), p2:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28560 reset in 114 ms.
Product exploration explored 100000 steps with 28600 reset in 149 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 524 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1047 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 953 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 20:46:25] [INFO ] Invariant cache hit.
[2024-05-21 20:46:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:46:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:46:25] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-21 20:46:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:46:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:46:25] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-21 20:46:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:46:25] [INFO ] After 9ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-21 20:46:25] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-21 20:46:25] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 64/64 transitions.
Graph (complete) has 170 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 63
Applied a total of 2 rules in 14 ms. Remains 57 /58 variables (removed 1) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 57/58 places, 63/64 transitions.
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1048 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3995 steps, run visited all 2 properties in 15 ms. (steps per millisecond=266 )
Probabilistic random walk after 3995 steps, saw 1811 distinct states, run finished after 15 ms. (steps per millisecond=266 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p2), (F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 20:46:26] [INFO ] Invariant cache hit.
[2024-05-21 20:46:26] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 20:46:26] [INFO ] Invariant cache hit.
[2024-05-21 20:46:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:46:26] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-21 20:46:26] [INFO ] Invariant cache hit.
[2024-05-21 20:46:26] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 58/58 places, 64/64 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 973 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1032 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:46:27] [INFO ] Invariant cache hit.
[2024-05-21 20:46:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:46:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:46:27] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:46:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:46:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:46:27] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:46:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:46:27] [INFO ] After 26ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:46:27] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-21 20:46:27] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 64/64 transitions.
Graph (complete) has 170 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 63
Applied a total of 2 rules in 2 ms. Remains 57 /58 variables (removed 1) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 57/58 places, 63/64 transitions.
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 972 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1061 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3995 steps, run visited all 2 properties in 12 ms. (steps per millisecond=332 )
Probabilistic random walk after 3995 steps, saw 1811 distinct states, run finished after 12 ms. (steps per millisecond=332 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p2))), (F p2)]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 28600 reset in 92 ms.
Product exploration explored 100000 steps with 28580 reset in 85 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 14 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 20:46:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:46:29] [INFO ] Invariant cache hit.
[2024-05-21 20:46:29] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 58/58 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin12791517802635770646
[2024-05-21 20:46:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12791517802635770646
Running compilation step : cd /tmp/ltsmin12791517802635770646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 128 ms.
Running link step : cd /tmp/ltsmin12791517802635770646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin12791517802635770646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16574946678482467250.hoa' '--buchi-type=spotba'
LTSmin run took 255 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-13 finished in 5467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(G(p0)) U (p1 U G(p2)))&&X(X(p2)))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 65 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 64 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 63 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 62 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 62 transition count 74
Applied a total of 43 rules in 10 ms. Remains 62 /82 variables (removed 20) and now considering 74/113 (removed 39) transitions.
// Phase 1: matrix 74 rows 62 cols
[2024-05-21 20:46:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:46:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 20:46:29] [INFO ] Invariant cache hit.
[2024-05-21 20:46:29] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 20:46:29] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 20:46:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:46:29] [INFO ] Invariant cache hit.
[2024-05-21 20:46:29] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/82 places, 74/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 62/82 places, 74/113 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={1} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 3}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=1 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=4 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=4 dest: 6}, { cond=(AND p2 p0), acceptance={0} source=4 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=5 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=6 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=7 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s56 1)), p1:(AND (GEQ s6 1) (GEQ s44 1)), p0:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-14 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 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 49 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 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 55 place count 58 transition count 64
Applied a total of 55 rules in 17 ms. Remains 58 /82 variables (removed 24) and now considering 64/113 (removed 49) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 20:46:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:46:30] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-21 20:46:30] [INFO ] Invariant cache hit.
[2024-05-21 20:46:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:46:30] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-21 20:46:30] [INFO ] Invariant cache hit.
[2024-05-21 20:46:30] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/82 places, 64/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 58/82 places, 64/113 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, p0, p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s31 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 32 steps with 8 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-15 finished in 565 ms.
All properties solved by simple procedures.
Total runtime 21391 ms.

BK_STOP 1716324391775

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DBSingleClientW-PT-d0m06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208200283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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