Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.5K Feb 26 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 15:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678238019787

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:13:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 01:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:13:41] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-08 01:13:41] [INFO ] Transformed 553 places.
[2023-03-08 01:13:41] [INFO ] Transformed 150 transitions.
[2023-03-08 01:13:41] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 121 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 2 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 88 transition count 120
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 88 transition count 117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 85 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 85 transition count 114
Applied a total of 55 rules in 23 ms. Remains 85 /109 variables (removed 24) and now considering 114/150 (removed 36) transitions.
// Phase 1: matrix 114 rows 85 cols
[2023-03-08 01:13:41] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-08 01:13:41] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-08 01:13:41] [INFO ] Invariant cache hit.
[2023-03-08 01:13:41] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:13:41] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-08 01:13:42] [INFO ] Invariant cache hit.
[2023-03-08 01:13:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/109 places, 114/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 85/109 places, 114/150 transitions.
Support contains 23 out of 85 places after structural reductions.
[2023-03-08 01:13:42] [INFO ] Flatten gal took : 32 ms
[2023-03-08 01:13:42] [INFO ] Flatten gal took : 12 ms
[2023-03-08 01:13:42] [INFO ] Input system was already deterministic with 114 transitions.
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 22) seen :8
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 516 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1003 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 974 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1061 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 983 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 516 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 986 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-08 01:13:43] [INFO ] Invariant cache hit.
[2023-03-08 01:13:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:13:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 01:13:44] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 01:13:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:13:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:13:44] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-08 01:13:44] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:13:44] [INFO ] After 162ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-08 01:13:45] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-08 01:13:45] [INFO ] After 830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 99 ms.
Support contains 16 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 114/114 transitions.
Graph (complete) has 252 edges and 85 vertex of which 84 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 84 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 82 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 82 transition count 107
Applied a total of 6 rules in 15 ms. Remains 82 /85 variables (removed 3) and now considering 107/114 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 82/85 places, 107/114 transitions.
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1033 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 1040 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 513 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1025 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Finished probabilistic random walk after 14856 steps, run visited all 13 properties in 114 ms. (steps per millisecond=130 )
Probabilistic random walk after 14856 steps, saw 6798 distinct states, run finished after 114 ms. (steps per millisecond=130 ) properties seen :13
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 281 edges and 85 vertex of which 84 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X((G(p1)&&p0)))||p2) U p2)))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 66 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 65 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 64 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 63 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 63 transition count 77
Applied a total of 47 rules in 13 ms. Remains 63 /85 variables (removed 22) and now considering 77/114 (removed 37) transitions.
// Phase 1: matrix 77 rows 63 cols
[2023-03-08 01:13:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:13:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 01:13:47] [INFO ] Invariant cache hit.
[2023-03-08 01:13:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:13:47] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-08 01:13:47] [INFO ] Invariant cache hit.
[2023-03-08 01:13:47] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 77/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 63/85 places, 77/114 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s56 1)), p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-01 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p2)||p1)))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 73 transition count 90
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 73 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 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 38 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 65 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 65 transition count 77
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 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 64 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 63 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 49 place count 63 transition count 72
Applied a total of 49 rules in 26 ms. Remains 63 /85 variables (removed 22) and now considering 72/114 (removed 42) transitions.
// Phase 1: matrix 72 rows 63 cols
[2023-03-08 01:13:47] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:13:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:13:47] [INFO ] Invariant cache hit.
[2023-03-08 01:13:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:13:47] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 01:13:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:47] [INFO ] Invariant cache hit.
[2023-03-08 01:13:47] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/85 places, 72/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 63/85 places, 72/114 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s33 1)), p1:(OR (LT s1 1) (LT s61 1)), p2:(OR (LT s1 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23828 reset in 233 ms.
Product exploration explored 100000 steps with 23876 reset in 142 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 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 (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 493 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 01:13:48] [INFO ] Invariant cache hit.
[2023-03-08 01:13:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:13:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:13:48] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 01:13:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:13:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:13:48] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 01:13:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:13:48] [INFO ] After 8ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 01:13:48] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 01:13:48] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 72/72 transitions.
Graph (complete) has 185 edges and 63 vertex of which 62 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 62 transition count 71
Applied a total of 2 rules in 7 ms. Remains 62 /63 variables (removed 1) and now considering 71/72 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 62/63 places, 71/72 transitions.
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 504 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8368 steps, run visited all 1 properties in 12 ms. (steps per millisecond=697 )
Probabilistic random walk after 8368 steps, saw 3654 distinct states, run finished after 12 ms. (steps per millisecond=697 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 330 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 01:13:49] [INFO ] Invariant cache hit.
[2023-03-08 01:13:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:13:49] [INFO ] Invariant cache hit.
[2023-03-08 01:13:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:13:49] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 01:13:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:49] [INFO ] Invariant cache hit.
[2023-03-08 01:13:49] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 63/63 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 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 (NOT p0) p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 01:13:49] [INFO ] Invariant cache hit.
[2023-03-08 01:13:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:13:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-08 01:13:49] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 01:13:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:13:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:13:49] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 01:13:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:13:49] [INFO ] After 9ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 01:13:49] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 01:13:49] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 72/72 transitions.
Graph (complete) has 185 edges and 63 vertex of which 62 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 62 transition count 71
Applied a total of 2 rules in 7 ms. Remains 62 /63 variables (removed 1) and now considering 71/72 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 62/63 places, 71/72 transitions.
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8368 steps, run visited all 1 properties in 12 ms. (steps per millisecond=697 )
Probabilistic random walk after 8368 steps, saw 3654 distinct states, run finished after 12 ms. (steps per millisecond=697 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 23914 reset in 106 ms.
Product exploration explored 100000 steps with 23807 reset in 111 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 01:13:50] [INFO ] Invariant cache hit.
[2023-03-08 01:13:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:13:50] [INFO ] Invariant cache hit.
[2023-03-08 01:13:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:13:50] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 01:13:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:50] [INFO ] Invariant cache hit.
[2023-03-08 01:13:50] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 63/63 places, 72/72 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-02 finished in 3335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 73 transition count 90
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 73 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 66 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 64 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 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 45 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 61 transition count 71
Applied a total of 53 rules in 11 ms. Remains 61 /85 variables (removed 24) and now considering 71/114 (removed 43) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 01:13:50] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:13:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 01:13:50] [INFO ] Invariant cache hit.
[2023-03-08 01:13:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:13:51] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-08 01:13:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:51] [INFO ] Invariant cache hit.
[2023-03-08 01:13:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/85 places, 71/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 61/85 places, 71/114 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-03 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 96
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 69 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 67 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 65 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 64 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 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 46 place count 64 transition count 78
Applied a total of 46 rules in 18 ms. Remains 64 /85 variables (removed 21) and now considering 78/114 (removed 36) transitions.
// Phase 1: matrix 78 rows 64 cols
[2023-03-08 01:13:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:13:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 01:13:51] [INFO ] Invariant cache hit.
[2023-03-08 01:13:51] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 01:13:51] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-08 01:13:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:51] [INFO ] Invariant cache hit.
[2023-03-08 01:13:51] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/85 places, 78/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 64/85 places, 78/114 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s60 1)), p1:(OR (LT s1 1) (LT s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23066 reset in 181 ms.
Product exploration explored 100000 steps with 22976 reset in 173 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 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 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 01:13:52] [INFO ] Invariant cache hit.
[2023-03-08 01:13:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:13:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:13:52] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 01:13:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:13:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:13:52] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 01:13:52] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 01:13:52] [INFO ] After 10ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 01:13:52] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 01:13:52] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 62 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 62 transition count 72
Applied a total of 4 rules in 8 ms. Remains 62 /64 variables (removed 2) and now considering 72/78 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 62/64 places, 72/78 transitions.
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7030 steps, run visited all 1 properties in 11 ms. (steps per millisecond=639 )
Probabilistic random walk after 7030 steps, saw 3129 distinct states, run finished after 11 ms. (steps per millisecond=639 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 226 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 :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 10 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 01:13:52] [INFO ] Invariant cache hit.
[2023-03-08 01:13:52] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:13:52] [INFO ] Invariant cache hit.
[2023-03-08 01:13:52] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 01:13:53] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-08 01:13:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:53] [INFO ] Invariant cache hit.
[2023-03-08 01:13:53] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 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 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2344 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 519 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 525 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7022 steps, run visited all 2 properties in 24 ms. (steps per millisecond=292 )
Probabilistic random walk after 7022 steps, saw 3115 distinct states, run finished after 25 ms. (steps per millisecond=280 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 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 170 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22848 reset in 102 ms.
Product exploration explored 100000 steps with 22889 reset in 194 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 9 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 01:13:54] [INFO ] Invariant cache hit.
[2023-03-08 01:13:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:13:54] [INFO ] Invariant cache hit.
[2023-03-08 01:13:54] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 01:13:54] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-08 01:13:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:54] [INFO ] Invariant cache hit.
[2023-03-08 01:13:54] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 64/64 places, 78/78 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-05 finished in 3528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 68 transition count 85
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 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 66 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 63 transition count 73
Applied a total of 49 rules in 17 ms. Remains 63 /85 variables (removed 22) and now considering 73/114 (removed 41) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 01:13:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:13:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 01:13:54] [INFO ] Invariant cache hit.
[2023-03-08 01:13:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:13:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-08 01:13:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:13:54] [INFO ] Invariant cache hit.
[2023-03-08 01:13:54] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/85 places, 73/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 63/85 places, 73/114 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22898 reset in 94 ms.
Product exploration explored 100000 steps with 22944 reset in 101 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 204 edges and 63 vertex of which 62 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2321 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5690 steps, run visited all 1 properties in 10 ms. (steps per millisecond=569 )
Probabilistic random walk after 5690 steps, saw 2478 distinct states, run finished after 11 ms. (steps per millisecond=517 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-08 01:13:55] [INFO ] Invariant cache hit.
[2023-03-08 01:13:55] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:13:55] [INFO ] Invariant cache hit.
[2023-03-08 01:13:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:13:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-08 01:13:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:55] [INFO ] Invariant cache hit.
[2023-03-08 01:13:55] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 63/63 places, 73/73 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 204 edges and 63 vertex of which 62 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5690 steps, run visited all 1 properties in 10 ms. (steps per millisecond=569 )
Probabilistic random walk after 5690 steps, saw 2478 distinct states, run finished after 10 ms. (steps per millisecond=569 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22938 reset in 91 ms.
Product exploration explored 100000 steps with 22806 reset in 103 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-08 01:13:56] [INFO ] Invariant cache hit.
[2023-03-08 01:13:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:13:56] [INFO ] Invariant cache hit.
[2023-03-08 01:13:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:13:56] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 01:13:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:13:56] [INFO ] Invariant cache hit.
[2023-03-08 01:13:56] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 63/63 places, 73/73 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-06 finished in 1824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)&&p0))||(p2 U !p3)||X(p4)))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 69 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 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 34 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 68 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 67 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 67 transition count 81
Applied a total of 38 rules in 7 ms. Remains 67 /85 variables (removed 18) and now considering 81/114 (removed 33) transitions.
// Phase 1: matrix 81 rows 67 cols
[2023-03-08 01:13:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:13:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:13:56] [INFO ] Invariant cache hit.
[2023-03-08 01:13:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:13:56] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-08 01:13:56] [INFO ] Invariant cache hit.
[2023-03-08 01:13:56] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/85 places, 81/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 67/85 places, 81/114 transitions.
Stuttering acceptance computed with spot in 352 ms :[true, (NOT p4), (AND p3 (NOT p4)), (OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p1) p3 (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p1) p3 (NOT p4))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), p3]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p4), acceptance={} source=1 dest: 0}], [{ cond=(AND p3 (NOT p2) (NOT p4)), acceptance={} source=2 dest: 0}, { cond=(AND p3 p2 (NOT p4)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p3 p2), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p4)) (AND (NOT p4) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p4) p1), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2) (NOT p4)) (AND p3 (NOT p2) (NOT p4) (NOT p1))), acceptance={} source=5 dest: 0}, { cond=(AND p0 p3 (NOT p2) (NOT p4) p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p3 p2 (NOT p4) p1), acceptance={} source=5 dest: 7}, { cond=(OR (AND (NOT p0) p3 p2 (NOT p4)) (AND p3 p2 (NOT p4) (NOT p1))), acceptance={} source=5 dest: 8}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=7 dest: 0}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p0 p3 p2 p1), acceptance={} source=7 dest: 7}, { cond=(OR (AND (NOT p0) p3 p2) (AND p3 p2 (NOT p1))), acceptance={} source=7 dest: 8}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=8 dest: 0}, { cond=(AND p3 p2), acceptance={0} source=8 dest: 8}]], initial=3, aps=[p4:(AND (GEQ s1 1) (GEQ s59 1)), p3:(OR (LT s1 1) (LT s62 1)), p2:(AND (GEQ s3 1) (GEQ s25 1)), p0:(AND (GEQ s3 1) (GEQ s25 1)), p1:(AND (GEQ s24 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-07 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0||X(p1)))||X(X(G(p2)))))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 76 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 76 transition count 95
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 71 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 71 transition count 90
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 71 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 69 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 69 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 69 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 68 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 68 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 67 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 67 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 67 transition count 78
Applied a total of 41 rules in 12 ms. Remains 67 /85 variables (removed 18) and now considering 78/114 (removed 36) transitions.
// Phase 1: matrix 78 rows 67 cols
[2023-03-08 01:13:57] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:13:57] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:13:57] [INFO ] Invariant cache hit.
[2023-03-08 01:13:57] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 01:13:57] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-08 01:13:57] [INFO ] Invariant cache hit.
[2023-03-08 01:13:57] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/85 places, 78/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 67/85 places, 78/114 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1)), p1:(AND (GEQ s1 1) (GEQ s65 1)), p2:(AND (GEQ s6 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-08 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((!p0 U X((p1&&X((p1 U (!p2||G(p1))))))))))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 76 transition count 99
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 76 transition count 99
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 70 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 70 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 70 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 68 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 68 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 67 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 66 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 66 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 66 transition count 82
Applied a total of 42 rules in 3 ms. Remains 66 /85 variables (removed 19) and now considering 82/114 (removed 32) transitions.
// Phase 1: matrix 82 rows 66 cols
[2023-03-08 01:13:57] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:13:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:13:57] [INFO ] Invariant cache hit.
[2023-03-08 01:13:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:13:57] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 01:13:57] [INFO ] Invariant cache hit.
[2023-03-08 01:13:57] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/85 places, 82/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 66/85 places, 82/114 transitions.
Stuttering acceptance computed with spot in 571 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 9}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={1} source=8 dest: 8}, { cond=p0, acceptance={0, 1} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=9 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={1} source=10 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=10 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 12}, { cond=(AND p0 p1), acceptance={0, 1} source=10 dest: 13}], [{ cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=11 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=11 dest: 9}, { cond=(AND p1 p2), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=12 dest: 9}, { cond=(AND p1 p2), acceptance={} source=12 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=13 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=13 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=13 dest: 10}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=13 dest: 12}, { cond=(AND p0 p1 p2), acceptance={0} source=13 dest: 13}]], initial=0, aps=[p0:(AND (GEQ s20 1) (GEQ s24 1)), p1:(OR (LT s1 1) (LT s45 1)), p2:(AND (GEQ s1 1) (GEQ s64 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25472 reset in 144 ms.
Product exploration explored 100000 steps with 25345 reset in 162 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 216 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 469 ms. Reduced automaton from 14 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 978 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1065 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 528 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 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 502 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 01:14:00] [INFO ] Invariant cache hit.
[2023-03-08 01:14:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:00] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-08 01:14:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:00] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-08 01:14:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:00] [INFO ] After 67ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-08 01:14:00] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 01:14:00] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 82/82 transitions.
Graph (complete) has 196 edges and 66 vertex of which 65 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 65 transition count 81
Applied a total of 2 rules in 5 ms. Remains 65 /66 variables (removed 1) and now considering 81/82 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 65/66 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 986 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1025 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 528 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Finished probabilistic random walk after 20336 steps, run visited all 6 properties in 91 ms. (steps per millisecond=223 )
Probabilistic random walk after 20336 steps, saw 9063 distinct states, run finished after 91 ms. (steps per millisecond=223 ) properties seen :6
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2)), (F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 11 factoid took 670 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p0)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 330 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p0)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-08 01:14:02] [INFO ] Invariant cache hit.
[2023-03-08 01:14:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:14:02] [INFO ] Invariant cache hit.
[2023-03-08 01:14:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:02] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-08 01:14:02] [INFO ] Invariant cache hit.
[2023-03-08 01:14:02] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 66/66 places, 82/82 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 216 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p0)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 507 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 996 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1037 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 01:14:03] [INFO ] Invariant cache hit.
[2023-03-08 01:14:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:14:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:03] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-08 01:14:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:03] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-08 01:14:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:03] [INFO ] After 34ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-08 01:14:03] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 01:14:03] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 82/82 transitions.
Graph (complete) has 196 edges and 66 vertex of which 65 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 65 transition count 81
Applied a total of 2 rules in 3 ms. Remains 65 /66 variables (removed 1) and now considering 81/82 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/66 places, 81/82 transitions.
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1055 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Finished probabilistic random walk after 20336 steps, run visited all 4 properties in 48 ms. (steps per millisecond=423 )
Probabilistic random walk after 20336 steps, saw 9063 distinct states, run finished after 48 ms. (steps per millisecond=423 ) properties seen :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (NOT p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p0), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 366 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 384 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 410 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 25438 reset in 155 ms.
Product exploration explored 100000 steps with 25388 reset in 106 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false]
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-08 01:14:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:14:06] [INFO ] Invariant cache hit.
[2023-03-08 01:14:06] [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 53 ms. Remains : 66/66 places, 82/82 transitions.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-08 01:14:06] [INFO ] Invariant cache hit.
[2023-03-08 01:14:06] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:14:06] [INFO ] Invariant cache hit.
[2023-03-08 01:14:06] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 01:14:06] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 01:14:06] [INFO ] Invariant cache hit.
[2023-03-08 01:14:06] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 66/66 places, 82/82 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-09 finished in 9195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 69 transition count 88
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 68 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 68 transition count 84
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 68 transition count 83
Applied a total of 37 rules in 6 ms. Remains 68 /85 variables (removed 17) and now considering 83/114 (removed 31) transitions.
// Phase 1: matrix 83 rows 68 cols
[2023-03-08 01:14:06] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:14:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:14:06] [INFO ] Invariant cache hit.
[2023-03-08 01:14:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 01:14:06] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 01:14:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:14:06] [INFO ] Invariant cache hit.
[2023-03-08 01:14:06] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/85 places, 83/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 68/85 places, 83/114 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s24 1) (GEQ s43 1)), p0:(OR (LT s1 1) (LT s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22852 reset in 98 ms.
Product exploration explored 100000 steps with 22949 reset in 102 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 222 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 517 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18849 steps, run visited all 1 properties in 32 ms. (steps per millisecond=589 )
Probabilistic random walk after 18849 steps, saw 8426 distinct states, run finished after 32 ms. (steps per millisecond=589 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 68 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 : 68/68 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-08 01:14:07] [INFO ] Invariant cache hit.
[2023-03-08 01:14:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:14:07] [INFO ] Invariant cache hit.
[2023-03-08 01:14:07] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 01:14:07] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 01:14:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:14:07] [INFO ] Invariant cache hit.
[2023-03-08 01:14:07] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 68/68 places, 83/83 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 222 edges and 68 vertex of which 67 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 : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18849 steps, run visited all 1 properties in 22 ms. (steps per millisecond=856 )
Probabilistic random walk after 18849 steps, saw 8426 distinct states, run finished after 23 ms. (steps per millisecond=819 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22913 reset in 99 ms.
Product exploration explored 100000 steps with 22751 reset in 105 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 83/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 67 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 66 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 65 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 64 transition count 75
Applied a total of 10 rules in 7 ms. Remains 64 /68 variables (removed 4) and now considering 75/83 (removed 8) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 01:14:08] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:14:08] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 01:14:08] [INFO ] Invariant cache hit.
[2023-03-08 01:14:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:14:08] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-08 01:14:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:14:08] [INFO ] Invariant cache hit.
[2023-03-08 01:14:08] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 75/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 64/68 places, 75/83 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-10 finished in 1966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 73 transition count 90
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 73 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 66 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 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 61 place count 58 transition count 64
Applied a total of 61 rules in 7 ms. Remains 58 /85 variables (removed 27) and now considering 64/114 (removed 50) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 01:14:08] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:14:08] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 01:14:08] [INFO ] Invariant cache hit.
[2023-03-08 01:14:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:14:08] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-08 01:14:08] [INFO ] Invariant cache hit.
[2023-03-08 01:14:08] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/85 places, 64/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 58/85 places, 64/114 transitions.
Stuttering acceptance computed with spot in 375 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-11 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 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 36 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 65 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 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 43 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 61 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 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 57 place count 60 transition count 68
Applied a total of 57 rules in 9 ms. Remains 60 /85 variables (removed 25) and now considering 68/114 (removed 46) transitions.
// Phase 1: matrix 68 rows 60 cols
[2023-03-08 01:14:09] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:14:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:14:09] [INFO ] Invariant cache hit.
[2023-03-08 01:14:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:09] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 01:14:09] [INFO ] Invariant cache hit.
[2023-03-08 01:14:09] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/85 places, 68/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 60/85 places, 68/114 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22961 reset in 100 ms.
Product exploration explored 100000 steps with 22900 reset in 93 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.3 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 4 ms. (steps per millisecond=269 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 4 ms. (steps per millisecond=269 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:14:10] [INFO ] Invariant cache hit.
[2023-03-08 01:14:10] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:14:10] [INFO ] Invariant cache hit.
[2023-03-08 01:14:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:10] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 01:14:10] [INFO ] Invariant cache hit.
[2023-03-08 01:14:10] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 60/60 places, 68/68 transitions.
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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 528 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 4 ms. (steps per millisecond=269 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 4 ms. (steps per millisecond=269 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22898 reset in 94 ms.
Product exploration explored 100000 steps with 22980 reset in 98 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:14:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:14:11] [INFO ] Invariant cache hit.
[2023-03-08 01:14:11] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42 ms. Remains : 60/60 places, 68/68 transitions.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:14:11] [INFO ] Invariant cache hit.
[2023-03-08 01:14:11] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 01:14:11] [INFO ] Invariant cache hit.
[2023-03-08 01:14:11] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:11] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 01:14:11] [INFO ] Invariant cache hit.
[2023-03-08 01:14:11] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 60/60 places, 68/68 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-13 finished in 2425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 91
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 67 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 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 38 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 64 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 62 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 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 55 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 59 transition count 65
Applied a total of 59 rules in 5 ms. Remains 59 /85 variables (removed 26) and now considering 65/114 (removed 49) transitions.
// Phase 1: matrix 65 rows 59 cols
[2023-03-08 01:14:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:14:11] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 01:14:11] [INFO ] Invariant cache hit.
[2023-03-08 01:14:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:14:11] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 01:14:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:14:11] [INFO ] Invariant cache hit.
[2023-03-08 01:14:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/85 places, 65/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 59/85 places, 65/114 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-14 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(p1)))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 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 36 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 65 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 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 43 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 61 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 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 57 place count 60 transition count 68
Applied a total of 57 rules in 14 ms. Remains 60 /85 variables (removed 25) and now considering 68/114 (removed 46) transitions.
// Phase 1: matrix 68 rows 60 cols
[2023-03-08 01:14:11] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:14:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 01:14:11] [INFO ] Invariant cache hit.
[2023-03-08 01:14:11] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:12] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 01:14:12] [INFO ] Invariant cache hit.
[2023-03-08 01:14:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/85 places, 68/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 60/85 places, 68/114 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s31 1)), p1:(OR (LT s1 1) (LT s57 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]]
Product exploration explored 100000 steps with 28597 reset in 96 ms.
Product exploration explored 100000 steps with 28568 reset in 99 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.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 01:14:12] [INFO ] Invariant cache hit.
[2023-03-08 01:14:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:14:12] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 01:14:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:12] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 01:14:12] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:12] [INFO ] After 9ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 01:14:12] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 01:14:12] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 68/68 transitions.
Graph (complete) has 174 edges and 60 vertex of which 59 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 59 transition count 67
Applied a total of 2 rules in 2 ms. Remains 59 /60 variables (removed 1) and now considering 67/68 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 59/60 places, 67/68 transitions.
Incomplete random walk after 10000 steps, including 2333 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 532 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 4 ms. (steps per millisecond=269 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 4 ms. (steps per millisecond=269 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:14:13] [INFO ] Invariant cache hit.
[2023-03-08 01:14:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:14:13] [INFO ] Invariant cache hit.
[2023-03-08 01:14:13] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:13] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-08 01:14:13] [INFO ] Invariant cache hit.
[2023-03-08 01:14:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 60/60 places, 68/68 transitions.
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.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 532 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 01:14:13] [INFO ] Invariant cache hit.
[2023-03-08 01:14:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:13] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 01:14:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:14:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:14:13] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 01:14:13] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:13] [INFO ] After 9ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 01:14:13] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 01:14:13] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 68/68 transitions.
Graph (complete) has 174 edges and 60 vertex of which 59 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 59 transition count 67
Applied a total of 2 rules in 3 ms. Remains 59 /60 variables (removed 1) and now considering 67/68 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 59/60 places, 67/68 transitions.
Incomplete random walk after 10000 steps, including 2343 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 4 ms. (steps per millisecond=269 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 4 ms. (steps per millisecond=269 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 28591 reset in 91 ms.
Product exploration explored 100000 steps with 28552 reset in 102 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:14:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:14:15] [INFO ] Invariant cache hit.
[2023-03-08 01:14:15] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 60/60 places, 68/68 transitions.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:14:15] [INFO ] Invariant cache hit.
[2023-03-08 01:14:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:14:15] [INFO ] Invariant cache hit.
[2023-03-08 01:14:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:15] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-08 01:14:15] [INFO ] Invariant cache hit.
[2023-03-08 01:14:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 60/60 places, 68/68 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-15 finished in 3445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((!p0 U X((p1&&X((p1 U (!p2||G(p1))))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m05-LTLFireability-13
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 85/85 places, 114/114 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 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 36 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 65 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 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 43 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 61 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 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 57 place count 60 transition count 68
Applied a total of 57 rules in 13 ms. Remains 60 /85 variables (removed 25) and now considering 68/114 (removed 46) transitions.
[2023-03-08 01:14:15] [INFO ] Invariant cache hit.
[2023-03-08 01:14:15] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:14:15] [INFO ] Invariant cache hit.
[2023-03-08 01:14:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:15] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 01:14:15] [INFO ] Invariant cache hit.
[2023-03-08 01:14:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/85 places, 68/114 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 173 ms. Remains : 60/85 places, 68/114 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s57 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23042 reset in 89 ms.
Product exploration explored 100000 steps with 23002 reset in 94 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 5 ms. (steps per millisecond=215 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 5 ms. (steps per millisecond=215 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:14:16] [INFO ] Invariant cache hit.
[2023-03-08 01:14:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:14:16] [INFO ] Invariant cache hit.
[2023-03-08 01:14:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 01:14:16] [INFO ] Invariant cache hit.
[2023-03-08 01:14:16] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 60/60 places, 68/68 transitions.
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.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 520 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1079 steps, run visited all 1 properties in 5 ms. (steps per millisecond=215 )
Probabilistic random walk after 1079 steps, saw 552 distinct states, run finished after 5 ms. (steps per millisecond=215 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22949 reset in 106 ms.
Product exploration explored 100000 steps with 22874 reset in 99 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:14:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:14:18] [INFO ] Invariant cache hit.
[2023-03-08 01:14:18] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 60/60 places, 68/68 transitions.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 01:14:18] [INFO ] Invariant cache hit.
[2023-03-08 01:14:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 01:14:18] [INFO ] Invariant cache hit.
[2023-03-08 01:14:18] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:14:18] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-08 01:14:18] [INFO ] Invariant cache hit.
[2023-03-08 01:14:18] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 60/60 places, 68/68 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-13 finished in 2858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(p1)))))'
[2023-03-08 01:14:18] [INFO ] Flatten gal took : 26 ms
[2023-03-08 01:14:18] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 01:14:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 114 transitions and 447 arcs took 1 ms.
Total runtime 37422 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d0m05
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA DBSingleClientW-PT-d0m05-LTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d0m05-LTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d0m05-LTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d0m05-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d0m05-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d0m05-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d0m05-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678238063712

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 11 (type EXCL) for 10 DBSingleClientW-PT-d0m05-LTLFireability-06
lola: time limit : 450 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for DBSingleClientW-PT-d0m05-LTLFireability-06
lola: result : false
lola: markings : 1018
lola: fired transitions : 1885
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 8 (type EXCL) for 3 DBSingleClientW-PT-d0m05-LTLFireability-05
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for DBSingleClientW-PT-d0m05-LTLFireability-05
lola: result : false
lola: markings : 432
lola: fired transitions : 783
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d0m05-LTLFireability-02
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d0m05-LTLFireability-02
lola: result : true
lola: markings : 2015
lola: fired transitions : 3714
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 13 DBSingleClientW-PT-d0m05-LTLFireability-09
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for DBSingleClientW-PT-d0m05-LTLFireability-09
lola: result : true
lola: markings : 776210
lola: fired transitions : 2727772
lola: time used : 3.000000
lola: memory pages used : 6
lola: LAUNCH task # 23 (type EXCL) for 22 DBSingleClientW-PT-d0m05-LTLFireability-15
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 23 (type EXCL) for DBSingleClientW-PT-d0m05-LTLFireability-15
lola: result : true
lola: markings : 7
lola: fired transitions : 6
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 20 (type EXCL) for 19 DBSingleClientW-PT-d0m05-LTLFireability-13
lola: time limit : 1798 sec
lola: memory limit: 32 pages
lola: FINISHED task # 20 (type EXCL) for DBSingleClientW-PT-d0m05-LTLFireability-13
lola: result : false
lola: markings : 198
lola: fired transitions : 349
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 17 (type EXCL) for 16 DBSingleClientW-PT-d0m05-LTLFireability-10
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: FINISHED task # 17 (type EXCL) for DBSingleClientW-PT-d0m05-LTLFireability-10
lola: result : false
lola: markings : 550
lola: fired transitions : 984
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m05-LTLFireability-02: LTL true LTL model checker
DBSingleClientW-PT-d0m05-LTLFireability-05: CONJ false LTL model checker
DBSingleClientW-PT-d0m05-LTLFireability-06: LTL false LTL model checker
DBSingleClientW-PT-d0m05-LTLFireability-09: LTL true LTL model checker
DBSingleClientW-PT-d0m05-LTLFireability-10: LTL false LTL model checker
DBSingleClientW-PT-d0m05-LTLFireability-13: LTL false LTL model checker
DBSingleClientW-PT-d0m05-LTLFireability-15: LTL true LTL model checker


Time elapsed: 3 secs. Pages in use: 6

Sequence of Actions to be Executed by the VM

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

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

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

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