Execution Chart

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

Trace from the execution

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

--------------------
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 1678238299847

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:18:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 01:18:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:18:21] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-08 01:18:21] [INFO ] Transformed 553 places.
[2023-03-08 01:18:21] [INFO ] Transformed 150 transitions.
[2023-03-08 01:18:21] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 444 places in 1 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 20 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 01:18:21] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-08 01:18:21] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-08 01:18:21] [INFO ] Invariant cache hit.
[2023-03-08 01:18:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 01:18:21] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-08 01:18:21] [INFO ] Invariant cache hit.
[2023-03-08 01:18:21] [INFO ] Dead Transitions using invariants and state equation in 71 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 404 ms. Remains : 77/109 places, 101/150 transitions.
Support contains 28 out of 77 places after structural reductions.
[2023-03-08 01:18:22] [INFO ] Flatten gal took : 31 ms
[2023-03-08 01:18:22] [INFO ] Flatten gal took : 10 ms
[2023-03-08 01:18:22] [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 2274 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 529 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1067 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 541 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 974 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1019 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1038 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 506 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-08 01:18:23] [INFO ] Invariant cache hit.
[2023-03-08 01:18:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:18:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:18:23] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-08 01:18:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:18:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:18:23] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-08 01:18:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 01:18:23] [INFO ] After 90ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :1 sat :9
[2023-03-08 01:18:23] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-08 01:18:23] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 13 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 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 71 transition count 88
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 71 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 71 transition count 87
Applied a total of 13 rules in 14 ms. Remains 71 /77 variables (removed 6) and now considering 87/101 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 71/77 places, 87/101 transitions.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1025 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 950 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 997 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Finished probabilistic random walk after 18835 steps, run visited all 9 properties in 120 ms. (steps per millisecond=156 )
Probabilistic random walk after 18835 steps, saw 8516 distinct states, run finished after 120 ms. (steps per millisecond=156 ) properties seen :9
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.3 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 11 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 01:18:25] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:18:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:18:25] [INFO ] Invariant cache hit.
[2023-03-08 01:18:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:18:25] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-08 01:18:25] [INFO ] Invariant cache hit.
[2023-03-08 01:18:25] [INFO ] Dead Transitions using invariants and state equation in 39 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 189 ms. Remains : 59/77 places, 69/101 transitions.
Stuttering acceptance computed with spot in 206 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 288 ms.
Product exploration explored 100000 steps with 50000 reset in 163 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 122 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 1022 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 14 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 01:18:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:18:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:18:26] [INFO ] Invariant cache hit.
[2023-03-08 01:18:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:18:26] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 01:18:26] [INFO ] Invariant cache hit.
[2023-03-08 01:18:26] [INFO ] Dead Transitions using invariants and state equation in 45 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 184 ms. Remains : 63/77 places, 72/101 transitions.
Stuttering acceptance computed with spot in 173 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 22986 reset in 169 ms.
Product exploration explored 100000 steps with 22837 reset in 126 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 81 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 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2269 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 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 29 ms. (steps per millisecond=296 )
Probabilistic random walk after 8584 steps, saw 3776 distinct states, run finished after 29 ms. (steps per millisecond=296 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 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 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 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 1 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 01:18:27] [INFO ] Invariant cache hit.
[2023-03-08 01:18:27] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:18:27] [INFO ] Invariant cache hit.
[2023-03-08 01:18:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:18:27] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 01:18:27] [INFO ] Invariant cache hit.
[2023-03-08 01:18:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 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 106 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 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 524 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 20 ms. (steps per millisecond=429 )
Probabilistic random walk after 8584 steps, saw 3776 distinct states, run finished after 20 ms. (steps per millisecond=429 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
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 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22827 reset in 79 ms.
Product exploration explored 100000 steps with 22919 reset in 88 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 164 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 11 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 01:18:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:18:29] [INFO ] Invariant cache hit.
[2023-03-08 01:18:29] [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 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 01:18:29] [INFO ] Invariant cache hit.
[2023-03-08 01:18:29] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:18:29] [INFO ] Invariant cache hit.
[2023-03-08 01:18:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:18:29] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-08 01:18:29] [INFO ] Invariant cache hit.
[2023-03-08 01:18:29] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 63/63 places, 72/72 transitions.
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-01 finished in 3473 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 3 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 01:18:29] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-08 01:18:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:18:29] [INFO ] Invariant cache hit.
[2023-03-08 01:18:29] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 01:18:29] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-08 01:18:29] [INFO ] Invariant cache hit.
[2023-03-08 01:18:29] [INFO ] Dead Transitions using invariants and state equation in 50 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 195 ms. Remains : 70/77 places, 87/101 transitions.
Stuttering acceptance computed with spot in 210 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 127 ms.
Product exploration explored 100000 steps with 50000 reset in 133 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 143 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 835 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 17 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 01:18:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:18:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:18:30] [INFO ] Invariant cache hit.
[2023-03-08 01:18:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:18:30] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 01:18:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:18:30] [INFO ] Invariant cache hit.
[2023-03-08 01:18:30] [INFO ] Dead Transitions using invariants and state equation in 42 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 186 ms. Remains : 64/77 places, 75/101 transitions.
Stuttering acceptance computed with spot in 55 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 3 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 253 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 12 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 01:18:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:18:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 01:18:30] [INFO ] Invariant cache hit.
[2023-03-08 01:18:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-08 01:18:30] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 01:18:30] [INFO ] Invariant cache hit.
[2023-03-08 01:18:30] [INFO ] Dead Transitions using invariants and state equation in 39 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 191 ms. Remains : 64/77 places, 77/101 transitions.
Stuttering acceptance computed with spot in 197 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 407 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 8 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 01:18:31] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:18:31] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 01:18:31] [INFO ] Invariant cache hit.
[2023-03-08 01:18:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:18:31] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-08 01:18:31] [INFO ] Invariant cache hit.
[2023-03-08 01:18:31] [INFO ] Dead Transitions using invariants and state equation in 33 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 60 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 7 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 230 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 8 ms. Remains 58 /77 variables (removed 19) and now considering 64/101 (removed 37) transitions.
[2023-03-08 01:18:31] [INFO ] Invariant cache hit.
[2023-03-08 01:18:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 01:18:31] [INFO ] Invariant cache hit.
[2023-03-08 01:18:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:18:31] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-08 01:18:31] [INFO ] Invariant cache hit.
[2023-03-08 01:18:31] [INFO ] Dead Transitions using invariants and state equation in 33 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 133 ms. Remains : 58/77 places, 64/101 transitions.
Stuttering acceptance computed with spot in 107 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 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-07 finished in 255 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 17 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 01:18:31] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:18:31] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 01:18:31] [INFO ] Invariant cache hit.
[2023-03-08 01:18:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:18:31] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-08 01:18:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:18:31] [INFO ] Invariant cache hit.
[2023-03-08 01:18:31] [INFO ] Dead Transitions using invariants and state equation in 36 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 159 ms. Remains : 61/77 places, 71/101 transitions.
Stuttering acceptance computed with spot in 71 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 2 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 242 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 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 01:18:31] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:18:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:18:31] [INFO ] Invariant cache hit.
[2023-03-08 01:18:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:18:31] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 01:18:31] [INFO ] Invariant cache hit.
[2023-03-08 01:18:31] [INFO ] Dead Transitions using invariants and state equation in 35 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 163 ms. Remains : 58/77 places, 64/101 transitions.
Stuttering acceptance computed with spot in 75 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 262 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 01:18:32] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:18:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:18:32] [INFO ] Invariant cache hit.
[2023-03-08 01:18:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 01:18:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-08 01:18:32] [INFO ] Invariant cache hit.
[2023-03-08 01:18:32] [INFO ] Dead Transitions using invariants and state equation in 45 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 168 ms. Remains : 62/77 places, 73/101 transitions.
Stuttering acceptance computed with spot in 265 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 2 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 460 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 15 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 01:18:32] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:18:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:18:32] [INFO ] Invariant cache hit.
[2023-03-08 01:18:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:18:32] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-08 01:18:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:18:32] [INFO ] Invariant cache hit.
[2023-03-08 01:18:32] [INFO ] Dead Transitions using invariants and state equation in 34 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 170 ms. Remains : 59/77 places, 66/101 transitions.
Stuttering acceptance computed with spot in 50 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 242 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 7 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 01:18:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:18:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:18:32] [INFO ] Invariant cache hit.
[2023-03-08 01:18:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 01:18:32] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 01:18:32] [INFO ] Invariant cache hit.
[2023-03-08 01:18:32] [INFO ] Dead Transitions using invariants and state equation in 35 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 152 ms. Remains : 62/77 places, 72/101 transitions.
Stuttering acceptance computed with spot in 98 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 118 ms.
Product exploration explored 100000 steps with 33333 reset in 123 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 85 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 590 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 11 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 01:18:33] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 01:18:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:18:33] [INFO ] Invariant cache hit.
[2023-03-08 01:18:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:18:33] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 01:18:33] [INFO ] Invariant cache hit.
[2023-03-08 01:18:33] [INFO ] Dead Transitions using invariants and state equation in 53 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 189 ms. Remains : 62/77 places, 73/101 transitions.
Stuttering acceptance computed with spot in 233 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 5813 steps with 1327 reset in 11 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-15 finished in 445 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 161 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 13 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 01:18:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:18:34] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 01:18:34] [INFO ] Invariant cache hit.
[2023-03-08 01:18:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:18:34] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-08 01:18:34] [INFO ] Invariant cache hit.
[2023-03-08 01:18:34] [INFO ] Dead Transitions using invariants and state equation in 39 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 170 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 22903 reset in 69 ms.
Product exploration explored 100000 steps with 22798 reset in 84 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 90 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 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 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 13 ms. (steps per millisecond=660 )
Probabilistic random walk after 8584 steps, saw 3776 distinct states, run finished after 13 ms. (steps per millisecond=660 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 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 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 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 1 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 01:18:35] [INFO ] Invariant cache hit.
[2023-03-08 01:18:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:18:35] [INFO ] Invariant cache hit.
[2023-03-08 01:18:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:18:35] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-08 01:18:35] [INFO ] Invariant cache hit.
[2023-03-08 01:18:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 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.0 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 57 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 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 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 12 ms. (steps per millisecond=715 )
Probabilistic random walk after 8584 steps, saw 3776 distinct states, run finished after 12 ms. (steps per millisecond=715 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 91 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 140 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22894 reset in 78 ms.
Product exploration explored 100000 steps with 22953 reset in 80 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 175 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 11 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 01:18:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:18:36] [INFO ] Invariant cache hit.
[2023-03-08 01:18:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 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 0 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-08 01:18:36] [INFO ] Invariant cache hit.
[2023-03-08 01:18:36] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 01:18:36] [INFO ] Invariant cache hit.
[2023-03-08 01:18:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:18:36] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-08 01:18:36] [INFO ] Invariant cache hit.
[2023-03-08 01:18:36] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 63/63 places, 72/72 transitions.
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-01 finished in 2877 ms.
[2023-03-08 01:18:36] [INFO ] Flatten gal took : 7 ms
[2023-03-08 01:18:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 01:18:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 77 places, 101 transitions and 397 arcs took 1 ms.
Total runtime 15388 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d0m09
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA DBSingleClientW-PT-d0m09-LTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678238317829

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d0m09-LTLFireability-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d0m09-LTLFireability-01
lola: result : false
lola: markings : 537
lola: fired transitions : 946
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m09-LTLFireability-01: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DBSingleClientW-PT-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 r103-tall-167814478000220"
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 ;