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.r105-tall-167814480900220.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 ltsminxred
Input is DBSingleClientW-PT-d0m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480900220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 15:34 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-d0m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678265396599

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:49:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 08:49:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:49:58] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-08 08:49:58] [INFO ] Transformed 553 places.
[2023-03-08 08:49:58] [INFO ] Transformed 150 transitions.
[2023-03-08 08:49:58] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 35 place count 85 transition count 111
Iterating global reduction 1 with 17 rules applied. Total rules applied 52 place count 85 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 85 transition count 110
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 77 transition count 102
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 77 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 77 transition count 101
Applied a total of 70 rules in 23 ms. Remains 77 /109 variables (removed 32) and now considering 101/150 (removed 49) transitions.
// Phase 1: matrix 101 rows 77 cols
[2023-03-08 08:49:58] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-08 08:49:58] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-08 08:49:58] [INFO ] Invariant cache hit.
[2023-03-08 08:49:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 08:49:58] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-08 08:49:58] [INFO ] Invariant cache hit.
[2023-03-08 08:49:59] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/109 places, 101/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 77/109 places, 101/150 transitions.
Support contains 28 out of 77 places after structural reductions.
[2023-03-08 08:49:59] [INFO ] Flatten gal took : 37 ms
[2023-03-08 08:49:59] [INFO ] Flatten gal took : 12 ms
[2023-03-08 08:49:59] [INFO ] Input system was already deterministic with 101 transitions.
Support contains 27 out of 77 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 10000 steps, including 1062 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 522 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 504 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1009 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 967 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 08:50:00] [INFO ] Invariant cache hit.
[2023-03-08 08:50:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:50:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 08:50:00] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-08 08:50:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:50:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:50:00] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-08 08:50:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 08:50:00] [INFO ] After 65ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-08 08:50:01] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-08 08:50:01] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 10 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 101/101 transitions.
Graph (complete) has 232 edges and 77 vertex of which 76 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 76 transition count 100
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 70 transition count 87
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 70 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 70 transition count 86
Applied a total of 15 rules in 15 ms. Remains 70 /77 variables (removed 7) and now considering 86/101 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 70/77 places, 86/101 transitions.
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1017 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 86 rows 70 cols
[2023-03-08 08:50:01] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 08:50:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-08 08:50:02] [INFO ] After 1226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 08:50:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:50:02] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 08:50:02] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 08:50:03] [INFO ] After 35ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 08:50:03] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 08:50:03] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 14 ms.
Support contains 7 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 86/86 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 69 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 68 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 67 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 66 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 65 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 65 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 65 transition count 77
Applied a total of 12 rules in 17 ms. Remains 65 /70 variables (removed 5) and now considering 77/86 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 65/70 places, 77/86 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1036 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Finished probabilistic random walk after 6341 steps, run visited all 4 properties in 60 ms. (steps per millisecond=105 )
Probabilistic random walk after 6341 steps, saw 2873 distinct states, run finished after 60 ms. (steps per millisecond=105 ) properties seen :4
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 256 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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(F(p0))||G(p1)))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 68 transition count 87
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 66 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 64 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 60 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 59 transition count 69
Applied a total of 42 rules in 14 ms. Remains 59 /77 variables (removed 18) and now considering 69/101 (removed 32) transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 08:50:03] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 08:50:04] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 08:50:04] [INFO ] Invariant cache hit.
[2023-03-08 08:50:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:50:04] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 08:50:04] [INFO ] Invariant cache hit.
[2023-03-08 08:50:04] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/77 places, 69/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 59/77 places, 69/101 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s8 1) (LT s45 1)), p1:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Product exploration explored 100000 steps with 50000 reset in 189 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.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-00 finished in 1169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 68 transition count 83
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 68 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 68 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 66 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 65 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 64 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 63 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 63 transition count 72
Applied a total of 32 rules in 16 ms. Remains 63 /77 variables (removed 14) and now considering 72/101 (removed 29) transitions.
// Phase 1: matrix 72 rows 63 cols
[2023-03-08 08:50:05] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:50:05] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 08:50:05] [INFO ] Invariant cache hit.
[2023-03-08 08:50:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:50:05] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 08:50:05] [INFO ] Invariant cache hit.
[2023-03-08 08:50:05] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/77 places, 72/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 63/77 places, 72/101 transitions.
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (LT s1 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22849 reset in 187 ms.
Product exploration explored 100000 steps with 22847 reset in 141 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2263 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8584 steps, run visited all 1 properties in 44 ms. (steps per millisecond=195 )
Probabilistic random walk after 8584 steps, saw 3776 distinct states, run finished after 45 ms. (steps per millisecond=190 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:50:07] [INFO ] Invariant cache hit.
[2023-03-08 08:50:07] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 08:50:07] [INFO ] Invariant cache hit.
[2023-03-08 08:50:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:50:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 08:50:07] [INFO ] Invariant cache hit.
[2023-03-08 08:50:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 63/63 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8584 steps, run visited all 1 properties in 56 ms. (steps per millisecond=153 )
Probabilistic random walk after 8584 steps, saw 3776 distinct states, run finished after 56 ms. (steps per millisecond=153 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22918 reset in 88 ms.
Product exploration explored 100000 steps with 22951 reset in 92 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 10 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:50:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:50:09] [INFO ] Invariant cache hit.
[2023-03-08 08:50:09] [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 65 ms. Remains : 63/63 places, 72/72 transitions.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:50:09] [INFO ] Invariant cache hit.
[2023-03-08 08:50:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 08:50:09] [INFO ] Invariant cache hit.
[2023-03-08 08:50:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:50:09] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-08 08:50:09] [INFO ] Invariant cache hit.
[2023-03-08 08:50:09] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 63/63 places, 72/72 transitions.
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-01 finished in 4417 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(p1) U !p2)||(F(p1)&&p3)||p0)))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 70 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 70 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 70 transition count 87
Applied a total of 15 rules in 1 ms. Remains 70 /77 variables (removed 7) and now considering 87/101 (removed 14) transitions.
// Phase 1: matrix 87 rows 70 cols
[2023-03-08 08:50:09] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-08 08:50:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 08:50:09] [INFO ] Invariant cache hit.
[2023-03-08 08:50:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 08:50:09] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 08:50:09] [INFO ] Invariant cache hit.
[2023-03-08 08:50:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/77 places, 87/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 70/77 places, 87/101 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))), (OR (NOT p1) p2), true, (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2 (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=5, aps=[p1:(AND (GEQ s1 1) (GEQ s53 1)), p0:(OR (LT s1 1) (LT s63 1)), p2:(AND (GEQ s1 1) (GEQ s67 1)), p3:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 230 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1) p3))), (X (NOT (AND (NOT p0) p2 p1 (NOT p3)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2 p1 (NOT p3))))
Knowledge based reduction with 8 factoid took 278 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-03 finished in 1057 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 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 68 transition count 85
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 67 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 66 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 65 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 64 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 30 place count 64 transition count 75
Applied a total of 30 rules in 19 ms. Remains 64 /77 variables (removed 13) and now considering 75/101 (removed 26) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 08:50:10] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:50:10] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:50:10] [INFO ] Invariant cache hit.
[2023-03-08 08:50:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:50:10] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 08:50:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:50:10] [INFO ] Invariant cache hit.
[2023-03-08 08:50:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/77 places, 75/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 64/77 places, 75/101 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-04 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 (AND (GEQ s1 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s57 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-04 finished in 277 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((F(p0)&&F(G(p1))&&G(p2))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 69 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 67 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 66 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 65 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 64 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 64 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 64 transition count 77
Applied a total of 30 rules in 9 ms. Remains 64 /77 variables (removed 13) and now considering 77/101 (removed 24) transitions.
// Phase 1: matrix 77 rows 64 cols
[2023-03-08 08:50:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:50:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 08:50:10] [INFO ] Invariant cache hit.
[2023-03-08 08:50:10] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 08:50:10] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-08 08:50:10] [INFO ] Invariant cache hit.
[2023-03-08 08:50:11] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/77 places, 77/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 64/77 places, 77/101 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s44 1)), p0:(OR (LT s13 1) (LT s36 1)), p1:(AND (GEQ s16 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-05 finished in 454 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(F(p0)))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 67 transition count 82
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 58 transition count 64
Applied a total of 44 rules in 9 ms. Remains 58 /77 variables (removed 19) and now considering 64/101 (removed 37) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 08:50:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:50:11] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-08 08:50:11] [INFO ] Invariant cache hit.
[2023-03-08 08:50:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:50:11] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 08:50:11] [INFO ] Invariant cache hit.
[2023-03-08 08:50:11] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/77 places, 64/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 58/77 places, 64/101 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-06 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 67 transition count 82
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 58 transition count 64
Applied a total of 44 rules in 10 ms. Remains 58 /77 variables (removed 19) and now considering 64/101 (removed 37) transitions.
[2023-03-08 08:50:11] [INFO ] Invariant cache hit.
[2023-03-08 08:50:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 08:50:11] [INFO ] Invariant cache hit.
[2023-03-08 08:50:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:50:11] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 08:50:11] [INFO ] Invariant cache hit.
[2023-03-08 08:50:11] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/77 places, 64/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 58/77 places, 64/101 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s21 1)), p1:(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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-07 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 67 transition count 82
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 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 36 place count 61 transition count 71
Applied a total of 36 rules in 26 ms. Remains 61 /77 variables (removed 16) and now considering 71/101 (removed 30) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 08:50:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:50:11] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 08:50:11] [INFO ] Invariant cache hit.
[2023-03-08 08:50:12] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:50:12] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-08 08:50:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:50:12] [INFO ] Invariant cache hit.
[2023-03-08 08:50:12] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/77 places, 71/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 61/77 places, 71/101 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s32 1)), p1:(OR (AND (GEQ s1 1) (GEQ s59 1)) (AND (GEQ s1 1) (GEQ s32 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-08 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 67 transition count 82
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 58 transition count 64
Applied a total of 44 rules in 7 ms. Remains 58 /77 variables (removed 19) and now considering 64/101 (removed 37) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 08:50:12] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:50:12] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 08:50:12] [INFO ] Invariant cache hit.
[2023-03-08 08:50:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:50:12] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-08 08:50:12] [INFO ] Invariant cache hit.
[2023-03-08 08:50:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/77 places, 64/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 58/77 places, 64/101 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-09 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' '!((X(X(X(p0)))&&(p1 U (F(p0) U p2))))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 68 transition count 85
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 66 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 63 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 62 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 62 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 62 transition count 73
Applied a total of 34 rules in 7 ms. Remains 62 /77 variables (removed 15) and now considering 73/101 (removed 28) transitions.
// Phase 1: matrix 73 rows 62 cols
[2023-03-08 08:50:12] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:50:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 08:50:12] [INFO ] Invariant cache hit.
[2023-03-08 08:50:12] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:50:12] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 08:50:12] [INFO ] Invariant cache hit.
[2023-03-08 08:50:12] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/77 places, 73/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 62/77 places, 73/101 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p2), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s27 1)), p1:(AND (GEQ s1 1) (GEQ s50 1)), p0:(AND (GEQ s0 1) (GEQ s22 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-11 finished in 464 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 U p1))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 68 transition count 83
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 68 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 68 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 66 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 66 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 64 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 62 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 60 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 60 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 59 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 59 transition count 66
Applied a total of 41 rules in 14 ms. Remains 59 /77 variables (removed 18) and now considering 66/101 (removed 35) transitions.
// Phase 1: matrix 66 rows 59 cols
[2023-03-08 08:50:12] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:50:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 08:50:12] [INFO ] Invariant cache hit.
[2023-03-08 08:50:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:50:13] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 08:50:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:50:13] [INFO ] Invariant cache hit.
[2023-03-08 08:50:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/77 places, 66/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 59/77 places, 66/101 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s54 1)), p0:(AND (GEQ s17 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-12 finished in 286 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((G(p1)||p0)))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 67 transition count 82
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 66 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 65 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 64 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 62 transition count 72
Applied a total of 34 rules in 13 ms. Remains 62 /77 variables (removed 15) and now considering 72/101 (removed 29) transitions.
// Phase 1: matrix 72 rows 62 cols
[2023-03-08 08:50:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:50:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 08:50:13] [INFO ] Invariant cache hit.
[2023-03-08 08:50:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:50:13] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 08:50:13] [INFO ] Invariant cache hit.
[2023-03-08 08:50:13] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/77 places, 72/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 62/77 places, 72/101 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s27 1)), p0:(OR (LT s19 1) (LT s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 125 ms.
Product exploration explored 100000 steps with 33333 reset in 120 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 201 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 3 factoid took 115 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-d0m09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-14 finished in 689 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((G(p0)||X(p1))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 69 transition count 85
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 69 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 67 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 62 transition count 73
Applied a total of 32 rules in 4 ms. Remains 62 /77 variables (removed 15) and now considering 73/101 (removed 28) transitions.
// Phase 1: matrix 73 rows 62 cols
[2023-03-08 08:50:13] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:50:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:50:13] [INFO ] Invariant cache hit.
[2023-03-08 08:50:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:50:14] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 08:50:14] [INFO ] Invariant cache hit.
[2023-03-08 08:50:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/77 places, 73/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 62/77 places, 73/101 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s53 1)), p1:(OR (LT s18 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 877 steps with 193 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-15 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m09-LTLFireability-01
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 77/77 places, 101/101 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 68 transition count 83
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 68 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 68 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 66 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 65 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 64 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 63 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 63 transition count 72
Applied a total of 32 rules in 11 ms. Remains 63 /77 variables (removed 14) and now considering 72/101 (removed 29) transitions.
// Phase 1: matrix 72 rows 63 cols
[2023-03-08 08:50:14] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:50:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 08:50:14] [INFO ] Invariant cache hit.
[2023-03-08 08:50:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:50:14] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-08 08:50:14] [INFO ] Invariant cache hit.
[2023-03-08 08:50:14] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 63/77 places, 72/101 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 189 ms. Remains : 63/77 places, 72/101 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (LT s1 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22944 reset in 93 ms.
Product exploration explored 100000 steps with 22945 reset in 92 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8584 steps, run visited all 1 properties in 15 ms. (steps per millisecond=572 )
Probabilistic random walk after 8584 steps, saw 3776 distinct states, run finished after 15 ms. (steps per millisecond=572 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 228 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:50:15] [INFO ] Invariant cache hit.
[2023-03-08 08:50:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:50:15] [INFO ] Invariant cache hit.
[2023-03-08 08:50:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:50:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 08:50:16] [INFO ] Invariant cache hit.
[2023-03-08 08:50:16] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 63/63 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 530 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8584 steps, run visited all 1 properties in 14 ms. (steps per millisecond=613 )
Probabilistic random walk after 8584 steps, saw 3776 distinct states, run finished after 14 ms. (steps per millisecond=613 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22892 reset in 83 ms.
Product exploration explored 100000 steps with 22733 reset in 87 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:50:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:50:17] [INFO ] Invariant cache hit.
[2023-03-08 08:50:17] [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 53 ms. Remains : 63/63 places, 72/72 transitions.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 08:50:17] [INFO ] Invariant cache hit.
[2023-03-08 08:50:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 08:50:17] [INFO ] Invariant cache hit.
[2023-03-08 08:50:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:50:17] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 08:50:17] [INFO ] Invariant cache hit.
[2023-03-08 08:50:17] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 63/63 places, 72/72 transitions.
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-01 finished in 3482 ms.
[2023-03-08 08:50:17] [INFO ] Flatten gal took : 7 ms
[2023-03-08 08:50:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 08:50:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 77 places, 101 transitions and 397 arcs took 2 ms.
Total runtime 19411 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1411/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d0m09-LTLFireability-01

BK_STOP 1678265418833

--------------------
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
mcc2023
ltl formula name DBSingleClientW-PT-d0m09-LTLFireability-01
ltl formula formula --ltl=/tmp/1411/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 77 places, 101 transitions and 397 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1411/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1411/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1411/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1411/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-d0m09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d0m09, 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 r105-tall-167814480900220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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