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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 15:24 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-d0m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678237955005

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-d0m04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:12:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 01:12:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:12:36] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 01:12:36] [INFO ] Transformed 553 places.
[2023-03-08 01:12:36] [INFO ] Transformed 150 transitions.
[2023-03-08 01:12:36] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 37 place count 83 transition count 109
Iterating global reduction 1 with 19 rules applied. Total rules applied 56 place count 83 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 83 transition count 108
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 76 transition count 101
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 76 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 75 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 75 transition count 100
Applied a total of 73 rules in 27 ms. Remains 75 /109 variables (removed 34) and now considering 100/150 (removed 50) transitions.
// Phase 1: matrix 100 rows 75 cols
[2023-03-08 01:12:36] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-08 01:12:37] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-08 01:12:37] [INFO ] Invariant cache hit.
[2023-03-08 01:12:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 01:12:37] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-08 01:12:37] [INFO ] Invariant cache hit.
[2023-03-08 01:12:37] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/109 places, 100/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 75/109 places, 100/150 transitions.
Support contains 25 out of 75 places after structural reductions.
[2023-03-08 01:12:37] [INFO ] Flatten gal took : 26 ms
[2023-03-08 01:12:37] [INFO ] Flatten gal took : 18 ms
[2023-03-08 01:12:37] [INFO ] Input system was already deterministic with 100 transitions.
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10000 steps, including 539 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1017 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 534 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 520 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 01:12:38] [INFO ] Invariant cache hit.
[2023-03-08 01:12:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:12:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:12:38] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 01:12:38] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 01:12:38] [INFO ] After 8ms SMT Verify possible using 35 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 01:12:38] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 01:12:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:12:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:12:38] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 01:12:38] [INFO ] After 47ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 01:12:38] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-08 01:12:38] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 100/100 transitions.
Graph (complete) has 228 edges and 75 vertex of which 74 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 74 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 70 transition count 91
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 70 transition count 91
Applied a total of 10 rules in 18 ms. Remains 70 /75 variables (removed 5) and now considering 91/100 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 70/75 places, 91/100 transitions.
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 975 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 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 1023 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 514 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Probably explored full state space saw : 7218 states, properties seen :3
Probabilistic random walk after 17805 steps, saw 7218 distinct states, run finished after 60 ms. (steps per millisecond=296 ) properties seen :3
Explored full state space saw : 7255 states, properties seen :0
Exhaustive walk after 17842 steps, saw 7255 distinct states, run finished after 21 ms. (steps per millisecond=849 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 250 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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(p0)||G((!p0&&F(p1)))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 63 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 63 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 61 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 59 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 59 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 59 transition count 69
Applied a total of 39 rules in 8 ms. Remains 59 /75 variables (removed 16) and now considering 69/100 (removed 31) transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 01:12:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:12:39] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 01:12:39] [INFO ] Invariant cache hit.
[2023-03-08 01:12:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:39] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-08 01:12:39] [INFO ] Invariant cache hit.
[2023-03-08 01:12:39] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/75 places, 69/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 59/75 places, 69/100 transitions.
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1)), p1:(AND (GEQ s1 1) (GEQ s41 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-d0m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-00 finished in 602 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((X(X(!p0))||G(p1)))) U (p0||F(p2))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 66 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 66 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 63 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 63 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 61 transition count 71
Applied a total of 33 rules in 15 ms. Remains 61 /75 variables (removed 14) and now considering 71/100 (removed 29) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 01:12:40] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 01:12:40] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:12:40] [INFO ] Invariant cache hit.
[2023-03-08 01:12:40] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:12:40] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 01:12:40] [INFO ] Invariant cache hit.
[2023-03-08 01:12:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 71/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 61/75 places, 71/100 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s43 1)), p2:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s3 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 15 reset in 4 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-03 finished in 544 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(F(p0)) U G(!p1))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 64 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 64 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 64 transition count 76
Applied a total of 25 rules in 8 ms. Remains 64 /75 variables (removed 11) and now considering 76/100 (removed 24) transitions.
// Phase 1: matrix 76 rows 64 cols
[2023-03-08 01:12:40] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:12:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:12:40] [INFO ] Invariant cache hit.
[2023-03-08 01:12:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:12:40] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 01:12:40] [INFO ] Invariant cache hit.
[2023-03-08 01:12:40] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/75 places, 76/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 64/75 places, 76/100 transitions.
Stuttering acceptance computed with spot in 161 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s22 1) (GEQ s43 1)), p0:(AND (GEQ s1 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 89317 steps with 20337 reset in 171 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-05 finished in 537 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 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 66 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 66 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 63 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 63 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 61 transition count 71
Applied a total of 33 rules in 16 ms. Remains 61 /75 variables (removed 14) and now considering 71/100 (removed 29) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 01:12:41] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 01:12:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 01:12:41] [INFO ] Invariant cache hit.
[2023-03-08 01:12:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:12:41] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-08 01:12:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:12:41] [INFO ] Invariant cache hit.
[2023-03-08 01:12:41] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/75 places, 71/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 61/75 places, 71/100 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-06 finished in 267 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 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 63 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 63 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 61 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 59 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 59 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 59 transition count 69
Applied a total of 39 rules in 10 ms. Remains 59 /75 variables (removed 16) and now considering 69/100 (removed 31) transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 01:12:41] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:12:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 01:12:41] [INFO ] Invariant cache hit.
[2023-03-08 01:12:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:41] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 01:12:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:41] [INFO ] Invariant cache hit.
[2023-03-08 01:12:41] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/75 places, 69/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 59/75 places, 69/100 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22901 reset in 127 ms.
Product exploration explored 100000 steps with 23044 reset in 188 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 191 edges and 59 vertex of which 58 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 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 251 steps, including 54 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:12:42] [INFO ] Invariant cache hit.
[2023-03-08 01:12:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:12:42] [INFO ] Invariant cache hit.
[2023-03-08 01:12:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:42] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-08 01:12:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:42] [INFO ] Invariant cache hit.
[2023-03-08 01:12:42] [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 202 ms. Remains : 59/59 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 191 edges and 59 vertex of which 58 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 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1298 steps, including 285 resets, run visited all 1 properties in 9 ms. (steps per millisecond=144 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23045 reset in 76 ms.
Product exploration explored 100000 steps with 22959 reset in 140 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:12:43] [INFO ] Invariant cache hit.
[2023-03-08 01:12:43] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 01:12:43] [INFO ] Invariant cache hit.
[2023-03-08 01:12:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:43] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-08 01:12:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:43] [INFO ] Invariant cache hit.
[2023-03-08 01:12:43] [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 202 ms. Remains : 59/59 places, 69/69 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-07 finished in 2280 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((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 84
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 65 transition count 80
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 65 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 64 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 63 transition count 73
Applied a total of 29 rules in 4 ms. Remains 63 /75 variables (removed 12) and now considering 73/100 (removed 27) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 01:12:43] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:12:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:12:43] [INFO ] Invariant cache hit.
[2023-03-08 01:12:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:12:43] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-08 01:12:43] [INFO ] Invariant cache hit.
[2023-03-08 01:12:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 73/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 63/75 places, 73/100 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (AND (GEQ s23 1) (GEQ s37 1))) (NOT (AND (GEQ s17 1) (GEQ s24 1)))), p0:(AND (GEQ s17 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 205 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-08 finished in 854 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)&&X(G(!p1)))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 63 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 63 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 61 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 59 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 59 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 59 transition count 69
Applied a total of 39 rules in 15 ms. Remains 59 /75 variables (removed 16) and now considering 69/100 (removed 31) transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 01:12:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:12:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:12:44] [INFO ] Invariant cache hit.
[2023-03-08 01:12:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:44] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-08 01:12:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:44] [INFO ] Invariant cache hit.
[2023-03-08 01:12:44] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/75 places, 69/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 59/75 places, 69/100 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR p1 p0), p0, p1]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 0}, { cond=(NOT p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1)), p1:(OR (LT s1 1) (LT s42 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 37 steps with 7 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-09 finished in 319 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 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 85
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 65 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 65 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 64 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 63 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 63 transition count 75
Applied a total of 29 rules in 14 ms. Remains 63 /75 variables (removed 12) and now considering 75/100 (removed 25) transitions.
// Phase 1: matrix 75 rows 63 cols
[2023-03-08 01:12:44] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:12:44] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 01:12:44] [INFO ] Invariant cache hit.
[2023-03-08 01:12:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:45] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-08 01:12:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:45] [INFO ] Invariant cache hit.
[2023-03-08 01:12:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/75 places, 75/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 63/75 places, 75/100 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s62 1)) (OR (LT s1 1) (LT s61 1)) (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 22838 reset in 119 ms.
Product exploration explored 100000 steps with 23073 reset in 116 ms.
Computed a total of 5 stabilizing places and 10 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 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 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)]
Finished random walk after 3477 steps, including 798 resets, run visited all 1 properties in 11 ms. (steps per millisecond=316 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 75/75 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 01:12:45] [INFO ] Invariant cache hit.
[2023-03-08 01:12:45] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:12:45] [INFO ] Invariant cache hit.
[2023-03-08 01:12:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:45] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-08 01:12:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:45] [INFO ] Invariant cache hit.
[2023-03-08 01:12:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 63/63 places, 75/75 transitions.
Computed a total of 5 stabilizing places and 10 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 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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)]
Finished random walk after 684 steps, including 151 resets, run visited all 1 properties in 4 ms. (steps per millisecond=171 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22912 reset in 117 ms.
Product exploration explored 100000 steps with 22995 reset in 127 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 01:12:46] [INFO ] Invariant cache hit.
[2023-03-08 01:12:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:12:46] [INFO ] Invariant cache hit.
[2023-03-08 01:12:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:46] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-08 01:12:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:46] [INFO ] Invariant cache hit.
[2023-03-08 01:12:46] [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 195 ms. Remains : 63/63 places, 75/75 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-10 finished in 1938 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((X((F(G(p2))||p1))||p0))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 64 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 60 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 60 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 60 transition count 70
Applied a total of 37 rules in 2 ms. Remains 60 /75 variables (removed 15) and now considering 70/100 (removed 30) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 01:12:46] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:12:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:12:46] [INFO ] Invariant cache hit.
[2023-03-08 01:12:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:46] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-08 01:12:46] [INFO ] Invariant cache hit.
[2023-03-08 01:12:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/75 places, 70/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 60/75 places, 70/100 transitions.
Stuttering acceptance computed with spot in 116 ms :[(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-d0m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s22 1)), p1:(OR (LT s1 1) (LT s42 1)), p2:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23037 reset in 161 ms.
Product exploration explored 100000 steps with 22871 reset in 131 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 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 : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 464 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1019 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 551 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 539 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 01:12:48] [INFO ] Invariant cache hit.
[2023-03-08 01:12:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:12:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:12:48] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 16 factoid took 712 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[false, false, false]
Stuttering acceptance computed with spot in 98 ms :[false, false, false]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:12:49] [INFO ] Invariant cache hit.
[2023-03-08 01:12:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 01:12:49] [INFO ] Invariant cache hit.
[2023-03-08 01:12:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:49] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-08 01:12:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:49] [INFO ] Invariant cache hit.
[2023-03-08 01:12:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 60/60 places, 70/70 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 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 : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[false, false, false]
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 1008 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 01:12:49] [INFO ] Invariant cache hit.
[2023-03-08 01:12:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:12:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:12:49] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 01:12:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:12:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:12:49] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 01:12:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:49] [INFO ] After 6ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 01:12:49] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-08 01:12:49] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Graph (complete) has 178 edges and 60 vertex of which 59 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 59 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 58 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 58 transition count 64
Applied a total of 4 rules in 5 ms. Remains 58 /60 variables (removed 2) and now considering 64/70 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 58/60 places, 64/70 transitions.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 974 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1005 steps, run visited all 1 properties in 6 ms. (steps per millisecond=167 )
Probabilistic random walk after 1005 steps, saw 507 distinct states, run finished after 6 ms. (steps per millisecond=167 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[false, false, false]
Stuttering acceptance computed with spot in 93 ms :[false, false, false]
Stuttering acceptance computed with spot in 103 ms :[false, false, false]
Product exploration explored 100000 steps with 22988 reset in 80 ms.
Product exploration explored 100000 steps with 23004 reset in 90 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:12:50] [INFO ] Invariant cache hit.
[2023-03-08 01:12:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 01:12:50] [INFO ] Invariant cache hit.
[2023-03-08 01:12:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:50] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 01:12:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:50] [INFO ] Invariant cache hit.
[2023-03-08 01:12:50] [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 167 ms. Remains : 60/60 places, 70/70 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-12 finished in 3961 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(X(G(((F((X(p0) U G(p1)))||X(p0)) U p2)))))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 86
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 66 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 65 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 64 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 64 transition count 78
Applied a total of 24 rules in 2 ms. Remains 64 /75 variables (removed 11) and now considering 78/100 (removed 22) transitions.
// Phase 1: matrix 78 rows 64 cols
[2023-03-08 01:12:50] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:12:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 01:12:50] [INFO ] Invariant cache hit.
[2023-03-08 01:12:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:50] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-08 01:12:50] [INFO ] Invariant cache hit.
[2023-03-08 01:12:50] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/75 places, 78/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 64/75 places, 78/100 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s32 1)), p0:(AND (GEQ s15 1) (GEQ s36 1)), p1:(AND (GEQ s1 1) (GEQ s58 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-13 finished in 334 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))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 67 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 67 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 63 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 63 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 62 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 61 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 61 transition count 70
Applied a total of 33 rules in 5 ms. Remains 61 /75 variables (removed 14) and now considering 70/100 (removed 30) transitions.
// Phase 1: matrix 70 rows 61 cols
[2023-03-08 01:12:51] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:12:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:12:51] [INFO ] Invariant cache hit.
[2023-03-08 01:12:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:12:51] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-08 01:12:51] [INFO ] Invariant cache hit.
[2023-03-08 01:12:51] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 70/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 61/75 places, 70/100 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s37 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-14 finished in 295 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)))'
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' '!(F(G((X((F(G(p2))||p1))||p0))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m04-LTLFireability-12
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 68 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 68 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 64 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 64 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 64 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 60 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 60 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 60 transition count 70
Applied a total of 37 rules in 8 ms. Remains 60 /75 variables (removed 15) and now considering 70/100 (removed 30) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 01:12:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:12:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:12:51] [INFO ] Invariant cache hit.
[2023-03-08 01:12:51] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 01:12:51] [INFO ] Invariant cache hit.
[2023-03-08 01:12:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/75 places, 70/100 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 161 ms. Remains : 60/75 places, 70/100 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s22 1)), p1:(OR (LT s1 1) (LT s42 1)), p2:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23043 reset in 78 ms.
Product exploration explored 100000 steps with 22832 reset in 84 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 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 : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 447 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1090 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 515 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 515 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1019 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 01:12:53] [INFO ] Invariant cache hit.
[2023-03-08 01:12:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:12:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:12:53] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:2
[2023-03-08 01:12:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 01:12:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 01:12:53] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-08 01:12:53] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:53] [INFO ] After 12ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2023-03-08 01:12:53] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 01:12:53] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Graph (complete) has 178 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 69
Applied a total of 2 rules in 7 ms. Remains 59 /60 variables (removed 1) and now considering 69/70 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/60 places, 69/70 transitions.
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1049 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1005 steps, run visited all 2 properties in 8 ms. (steps per millisecond=125 )
Probabilistic random walk after 1005 steps, saw 507 distinct states, run finished after 9 ms. (steps per millisecond=111 ) properties seen :2
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 16 factoid took 760 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[false, false, false]
Stuttering acceptance computed with spot in 104 ms :[false, false, false]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:12:54] [INFO ] Invariant cache hit.
[2023-03-08 01:12:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 01:12:54] [INFO ] Invariant cache hit.
[2023-03-08 01:12:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:54] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 01:12:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:54] [INFO ] Invariant cache hit.
[2023-03-08 01:12:54] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 60/60 places, 70/70 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[false, false, false]
Finished random walk after 1355 steps, including 324 resets, run visited all 2 properties in 21 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[false, false, false]
Stuttering acceptance computed with spot in 128 ms :[false, false, false]
Stuttering acceptance computed with spot in 115 ms :[false, false, false]
Product exploration explored 100000 steps with 22908 reset in 85 ms.
Product exploration explored 100000 steps with 23052 reset in 77 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 01:12:55] [INFO ] Invariant cache hit.
[2023-03-08 01:12:55] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:12:55] [INFO ] Invariant cache hit.
[2023-03-08 01:12:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:12:55] [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:12:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:12:55] [INFO ] Invariant cache hit.
[2023-03-08 01:12:55] [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 187 ms. Remains : 60/60 places, 70/70 transitions.
Treatment of property DBSingleClientW-PT-d0m04-LTLFireability-12 finished in 4251 ms.
[2023-03-08 01:12:55] [INFO ] Flatten gal took : 6 ms
[2023-03-08 01:12:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 01:12:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 100 transitions and 393 arcs took 1 ms.
Total runtime 19428 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d0m04
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA DBSingleClientW-PT-d0m04-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d0m04-LTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

BK_STOP 1678237976947

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
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: LAUNCH task # 7 (type EXCL) for 6 DBSingleClientW-PT-d0m04-LTLFireability-12
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DBSingleClientW-PT-d0m04-LTLFireability-12
lola: result : true
lola: markings : 7420
lola: fired transitions : 16046
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d0m04-LTLFireability-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d0m04-LTLFireability-07
lola: result : true
lola: markings : 8044
lola: fired transitions : 17507
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DBSingleClientW-PT-d0m04-LTLFireability-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DBSingleClientW-PT-d0m04-LTLFireability-10
lola: result : false
lola: markings : 252
lola: fired transitions : 513
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-d0m04-LTLFireability-07: LTL true LTL model checker
DBSingleClientW-PT-d0m04-LTLFireability-10: LTL false LTL model checker
DBSingleClientW-PT-d0m04-LTLFireability-12: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

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

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

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