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.r327-tall-167889199800587.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 RefineWMG-PT-010011, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199800587
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 15:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 15:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 24K Mar 5 18:23 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 RefineWMG-PT-010011-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-010011-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679052892140

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-010011
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 11:34:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 11:34:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 11:34:53] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-17 11:34:53] [INFO ] Transformed 54 places.
[2023-03-17 11:34:53] [INFO ] Transformed 43 transitions.
[2023-03-17 11:34:53] [INFO ] Parsed PT model containing 54 places and 43 transitions and 128 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-010011-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA RefineWMG-PT-010011-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 129 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-17 11:34:54] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-17 11:34:54] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
[2023-03-17 11:34:54] [INFO ] Invariant cache hit.
[2023-03-17 11:34:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 11:34:54] [INFO ] Invariant cache hit.
[2023-03-17 11:34:54] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-17 11:34:54] [INFO ] Invariant cache hit.
[2023-03-17 11:34:54] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 54/54 places, 43/43 transitions.
Support contains 35 out of 54 places after structural reductions.
[2023-03-17 11:34:54] [INFO ] Flatten gal took : 19 ms
[2023-03-17 11:34:54] [INFO ] Flatten gal took : 7 ms
[2023-03-17 11:34:54] [INFO ] Input system was already deterministic with 43 transitions.
Support contains 32 out of 54 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 30) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-17 11:34:54] [INFO ] Invariant cache hit.
[2023-03-17 11:34:54] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 11:34:54] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-17 11:34:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-17 11:34:55] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-17 11:34:55] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-17 11:34:55] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 250 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Parikh walk visited 8 properties in 27 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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((G(p0) U p1))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:34:55] [INFO ] Invariant cache hit.
[2023-03-17 11:34:55] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
[2023-03-17 11:34:55] [INFO ] Invariant cache hit.
[2023-03-17 11:34:55] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-17 11:34:55] [INFO ] Invariant cache hit.
[2023-03-17 11:34:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-17 11:34:55] [INFO ] Invariant cache hit.
[2023-03-17 11:34:55] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s47 s4), p0:(GT s28 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-00 finished in 626 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||X(((p1||G(!p0)) U (p0&&(p1||G(!p0)))))) U X(X(G(!p1)))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:34:56] [INFO ] Invariant cache hit.
[2023-03-17 11:34:56] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-17 11:34:56] [INFO ] Invariant cache hit.
[2023-03-17 11:34:56] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 11:34:56] [INFO ] Invariant cache hit.
[2023-03-17 11:34:56] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-17 11:34:56] [INFO ] Invariant cache hit.
[2023-03-17 11:34:56] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND p1 (NOT p0)), p1, (AND (NOT p0) p1), (AND p0 p1), true, p1, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(LEQ s14 s5), p1:(GT 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 74 reset in 304 ms.
Product exploration explored 100000 steps with 4 reset in 410 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 446 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND p1 (NOT p0)), p1, (AND (NOT p0) p1), (AND p0 p1), true, p1, (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 11:34:58] [INFO ] Invariant cache hit.
[2023-03-17 11:34:58] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 11:34:58] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 11:34:58] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-17 11:34:58] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-17 11:34:58] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-17 11:34:58] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 226 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=75 )
Parikh walk visited 2 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 547 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Stuttering acceptance computed with spot in 150 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:34:59] [INFO ] Invariant cache hit.
[2023-03-17 11:34:59] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-17 11:34:59] [INFO ] Invariant cache hit.
[2023-03-17 11:34:59] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-17 11:34:59] [INFO ] Invariant cache hit.
[2023-03-17 11:34:59] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-17 11:34:59] [INFO ] Invariant cache hit.
[2023-03-17 11:34:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 54/54 places, 43/43 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 236 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 11:34:59] [INFO ] Invariant cache hit.
[2023-03-17 11:34:59] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-17 11:34:59] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 11:34:59] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 11:34:59] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 11:34:59] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-17 11:34:59] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 158 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=158 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Stuttering acceptance computed with spot in 249 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Stuttering acceptance computed with spot in 161 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Product exploration explored 100000 steps with 7 reset in 202 ms.
Product exploration explored 100000 steps with 0 reset in 314 ms.
Applying partial POR strategy [false, true, true, true, false]
Stuttering acceptance computed with spot in 153 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 6 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 34 transition count 24
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 19 rules in 16 ms. Remains 34 /54 variables (removed 20) and now considering 24/43 (removed 19) transitions.
// Phase 1: matrix 24 rows 34 cols
[2023-03-17 11:35:01] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-17 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-17 11:35:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 11:35:01] [INFO ] Invariant cache hit.
[2023-03-17 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/54 places, 24/43 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 34/54 places, 24/43 transitions.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-17 11:35:01] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-17 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-17 11:35:01] [INFO ] Invariant cache hit.
[2023-03-17 11:35:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 11:35:01] [INFO ] Invariant cache hit.
[2023-03-17 11:35:01] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-17 11:35:01] [INFO ] Invariant cache hit.
[2023-03-17 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 54/54 places, 43/43 transitions.
Treatment of property RefineWMG-PT-010011-LTLCardinality-01 finished in 5613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(p1))&&(p2||X(G(p0))))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:35:01] [INFO ] Invariant cache hit.
[2023-03-17 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-17 11:35:01] [INFO ] Invariant cache hit.
[2023-03-17 11:35:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 11:35:01] [INFO ] Invariant cache hit.
[2023-03-17 11:35:01] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-17 11:35:01] [INFO ] Invariant cache hit.
[2023-03-17 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p0), true]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s24 s30), p2:(AND (LEQ 3 s2) (LEQ s11 s28)), p1:(LEQ 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 106 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-04 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:35:02] [INFO ] Invariant cache hit.
[2023-03-17 11:35:02] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-17 11:35:02] [INFO ] Invariant cache hit.
[2023-03-17 11:35:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-17 11:35:02] [INFO ] Invariant cache hit.
[2023-03-17 11:35:02] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-17 11:35:02] [INFO ] Invariant cache hit.
[2023-03-17 11:35:02] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2839 reset in 186 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-05 finished in 436 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(p0))||G(p1)))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:35:02] [INFO ] Invariant cache hit.
[2023-03-17 11:35:02] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-17 11:35:02] [INFO ] Invariant cache hit.
[2023-03-17 11:35:02] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 11:35:02] [INFO ] Invariant cache hit.
[2023-03-17 11:35:02] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-17 11:35:02] [INFO ] Invariant cache hit.
[2023-03-17 11:35:02] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ s42 s36), p0:(GT s26 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Stack based approach found an accepted trace after 5375 steps with 0 reset with depth 5376 and stack size 5148 in 14 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-06 finished in 550 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 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:35:03] [INFO ] Invariant cache hit.
[2023-03-17 11:35:03] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2023-03-17 11:35:03] [INFO ] Invariant cache hit.
[2023-03-17 11:35:03] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 11:35:03] [INFO ] Invariant cache hit.
[2023-03-17 11:35:03] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-17 11:35:03] [INFO ] Invariant cache hit.
[2023-03-17 11:35:03] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s43)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1291 reset in 188 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-08 finished in 433 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&&G(p1)))&&F(G((p2 U X(p3)))))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:35:03] [INFO ] Invariant cache hit.
[2023-03-17 11:35:03] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-17 11:35:03] [INFO ] Invariant cache hit.
[2023-03-17 11:35:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-17 11:35:03] [INFO ] Invariant cache hit.
[2023-03-17 11:35:03] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-17 11:35:03] [INFO ] Invariant cache hit.
[2023-03-17 11:35:03] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3), (NOT p3), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 3 s38), p1:(LEQ s12 s18), p2:(LEQ s6 s7), p3:(LEQ s32 s12)], 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]]
Product exploration explored 100000 steps with 1 reset in 217 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-09 finished in 633 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 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 25 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 30 place count 22 transition count 19
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 36 place count 22 transition count 13
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 42 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 42 place count 16 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 15 transition count 12
Applied a total of 44 rules in 13 ms. Remains 15 /54 variables (removed 39) and now considering 12/43 (removed 31) transitions.
// Phase 1: matrix 12 rows 15 cols
[2023-03-17 11:35:04] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:04] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-17 11:35:04] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/54 places, 12/43 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 15/54 places, 12/43 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-10 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:(LEQ s13 s7), p0:(LEQ s6 s11)], 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 89 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-10 finished in 213 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&&(p1||G(p2)))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 23 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 29 place count 24 transition count 21
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 24 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 22 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 33 place count 22 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 20 transition count 17
Applied a total of 37 rules in 9 ms. Remains 20 /54 variables (removed 34) and now considering 17/43 (removed 26) transitions.
// Phase 1: matrix 17 rows 20 cols
[2023-03-17 11:35:04] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-17 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:04] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-17 11:35:04] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/54 places, 17/43 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 20/54 places, 17/43 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT s4 s16), p1:(GT s18 s10), p2:(AND (GT s4 s16) (GT 2 s6) (GT 2 s13))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-11 finished in 244 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((p0 U (p1||X(F((p1&&X(F(p1)))))))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 26 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 33 place count 20 transition count 18
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 38 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 15 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 43 place count 15 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 13 transition count 11
Applied a total of 47 rules in 13 ms. Remains 13 /54 variables (removed 41) and now considering 11/43 (removed 32) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-17 11:35:04] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-17 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:04] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 11:35:04] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/54 places, 11/43 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 13/54 places, 11/43 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s10 s6), p0:(OR (LEQ 3 s7) (LEQ 1 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-12 finished in 280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(F(p1)))||G(F(p1)))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-17 11:35:04] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-17 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-17 11:35:04] [INFO ] Invariant cache hit.
[2023-03-17 11:35:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 11:35:05] [INFO ] Invariant cache hit.
[2023-03-17 11:35:05] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-17 11:35:05] [INFO ] Invariant cache hit.
[2023-03-17 11:35:05] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s11), p1:(OR (LEQ s23 s47) (LEQ 3 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 228 ms.
Product exploration explored 100000 steps with 0 reset in 285 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (OR (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 379732 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379732 steps, saw 284922 distinct states, run finished after 3002 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 11:35:09] [INFO ] Invariant cache hit.
[2023-03-17 11:35:09] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 11:35:09] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 11:35:09] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 11:35:09] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 11:35:09] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-17 11:35:09] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 180 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=45 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (OR (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (OR p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:35:09] [INFO ] Invariant cache hit.
[2023-03-17 11:35:09] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-17 11:35:09] [INFO ] Invariant cache hit.
[2023-03-17 11:35:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 11:35:09] [INFO ] Invariant cache hit.
[2023-03-17 11:35:09] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-17 11:35:09] [INFO ] Invariant cache hit.
[2023-03-17 11:35:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 54/54 places, 43/43 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (OR p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 398597 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398597 steps, saw 297833 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 11:35:13] [INFO ] Invariant cache hit.
[2023-03-17 11:35:13] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-17 11:35:13] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 11:35:13] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-17 11:35:13] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 11:35:13] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 11:35:13] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 181 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=60 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (OR p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (OR p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 294 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 226 ms.
Product exploration explored 100000 steps with 0 reset in 244 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 25 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 17 place count 38 transition count 28
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 17 rules in 7 ms. Remains 38 /54 variables (removed 16) and now considering 28/43 (removed 15) transitions.
// Phase 1: matrix 28 rows 38 cols
[2023-03-17 11:35:14] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 11:35:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-17 11:35:14] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-17 11:35:14] [INFO ] Invariant cache hit.
[2023-03-17 11:35:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/54 places, 28/43 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 38/54 places, 28/43 transitions.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-17 11:35:14] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-17 11:35:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-17 11:35:14] [INFO ] Invariant cache hit.
[2023-03-17 11:35:14] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 11:35:14] [INFO ] Invariant cache hit.
[2023-03-17 11:35:14] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-17 11:35:14] [INFO ] Invariant cache hit.
[2023-03-17 11:35:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 54/54 places, 43/43 transitions.
Treatment of property RefineWMG-PT-010011-LTLCardinality-14 finished in 9954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||(p1&&(p1 U X(p1))))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:35:14] [INFO ] Invariant cache hit.
[2023-03-17 11:35:14] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-17 11:35:14] [INFO ] Invariant cache hit.
[2023-03-17 11:35:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-17 11:35:14] [INFO ] Invariant cache hit.
[2023-03-17 11:35:15] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-17 11:35:15] [INFO ] Invariant cache hit.
[2023-03-17 11:35:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p1:(LEQ 2 s18), p0:(LEQ s29 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 25023 reset in 160 ms.
Product exploration explored 100000 steps with 24964 reset in 188 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 11:35:15] [INFO ] Invariant cache hit.
[2023-03-17 11:35:16] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 11:35:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-17 11:35:16] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 11:35:16] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-17 11:35:16] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 232 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=77 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 308 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-17 11:35:16] [INFO ] Invariant cache hit.
[2023-03-17 11:35:16] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-17 11:35:16] [INFO ] Invariant cache hit.
[2023-03-17 11:35:16] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 11:35:16] [INFO ] Invariant cache hit.
[2023-03-17 11:35:16] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-17 11:35:16] [INFO ] Invariant cache hit.
[2023-03-17 11:35:16] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 54/54 places, 43/43 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 11:35:17] [INFO ] Invariant cache hit.
[2023-03-17 11:35:17] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 11:35:17] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-17 11:35:17] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 11:35:17] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-17 11:35:17] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 231 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=57 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 24998 reset in 154 ms.
Product exploration explored 100000 steps with 25092 reset in 148 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 36 transition count 26
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 18 rules in 9 ms. Remains 36 /54 variables (removed 18) and now considering 26/43 (removed 17) transitions.
// Phase 1: matrix 26 rows 36 cols
[2023-03-17 11:35:18] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-17 11:35:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-17 11:35:18] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-17 11:35:18] [INFO ] Invariant cache hit.
[2023-03-17 11:35:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/54 places, 26/43 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 36/54 places, 26/43 transitions.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-17 11:35:18] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-17 11:35:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-17 11:35:18] [INFO ] Invariant cache hit.
[2023-03-17 11:35:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-17 11:35:18] [INFO ] Invariant cache hit.
[2023-03-17 11:35:18] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-17 11:35:18] [INFO ] Invariant cache hit.
[2023-03-17 11:35:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 54/54 places, 43/43 transitions.
Treatment of property RefineWMG-PT-010011-LTLCardinality-15 finished in 4067 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||X(((p1||G(!p0)) U (p0&&(p1||G(!p0)))))) U X(X(G(!p1)))))'
Found a Lengthening insensitive property : RefineWMG-PT-010011-LTLCardinality-01
Stuttering acceptance computed with spot in 234 ms :[(AND p1 (NOT p0)), p1, (AND (NOT p0) p1), (AND p0 p1), true, p1, (OR (NOT p1) (NOT p0))]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 43 place count 16 transition count 9
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 49 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 49 place count 10 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 9 transition count 8
Applied a total of 51 rules in 7 ms. Remains 9 /54 variables (removed 45) and now considering 8/43 (removed 35) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-17 11:35:19] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 11:35:19] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-17 11:35:19] [INFO ] Invariant cache hit.
[2023-03-17 11:35:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 11:35:19] [INFO ] Invariant cache hit.
[2023-03-17 11:35:19] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-17 11:35:19] [INFO ] Invariant cache hit.
[2023-03-17 11:35:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/54 places, 8/43 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 86 ms. Remains : 9/54 places, 8/43 transitions.
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(LEQ s8 s5), p1:(GT 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 158 ms.
Entered a terminal (fully accepting) state of product in 69448 steps with 8 reset in 132 ms.
Treatment of property RefineWMG-PT-010011-LTLCardinality-01 finished in 695 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(F(p1)))||G(F(p1)))))'
Found a Shortening insensitive property : RefineWMG-PT-010011-LTLCardinality-14
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 25 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 35 place count 20 transition count 19
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 20 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 41 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 13 transition count 12
Applied a total of 49 rules in 10 ms. Remains 13 /54 variables (removed 41) and now considering 12/43 (removed 31) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-17 11:35:19] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-17 11:35:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-17 11:35:19] [INFO ] Invariant cache hit.
[2023-03-17 11:35:19] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 11:35:19] [INFO ] Invariant cache hit.
[2023-03-17 11:35:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-17 11:35:19] [INFO ] Invariant cache hit.
[2023-03-17 11:35:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/54 places, 12/43 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 114 ms. Remains : 13/54 places, 12/43 transitions.
Running random walk in product with property : RefineWMG-PT-010011-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s6), p1:(OR (LEQ s9 s11) (LEQ 3 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 123 ms.
Product exploration explored 100000 steps with 0 reset in 224 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (OR (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Finished random walk after 6586 steps, including 1 resets, run visited all 3 properties in 17 ms. (steps per millisecond=387 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (OR (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (OR p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-17 11:35:21] [INFO ] Invariant cache hit.
[2023-03-17 11:35:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 11:35:21] [INFO ] Invariant cache hit.
[2023-03-17 11:35:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:35:21] [INFO ] Invariant cache hit.
[2023-03-17 11:35:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-17 11:35:21] [INFO ] Invariant cache hit.
[2023-03-17 11:35:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 13/13 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (OR p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 598 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Finished Best-First random walk after 595 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=297 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (OR p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (OR p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-17 11:35:22] [INFO ] Invariant cache hit.
[2023-03-17 11:35:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-17 11:35:22] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-17 11:35:22] [INFO ] Invariant cache hit.
[2023-03-17 11:35:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 13/13 places, 12/12 transitions.
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-17 11:35:22] [INFO ] Invariant cache hit.
[2023-03-17 11:35:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-17 11:35:22] [INFO ] Invariant cache hit.
[2023-03-17 11:35:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 11:35:22] [INFO ] Invariant cache hit.
[2023-03-17 11:35:22] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 11:35:22] [INFO ] Invariant cache hit.
[2023-03-17 11:35:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 13/13 places, 12/12 transitions.
Treatment of property RefineWMG-PT-010011-LTLCardinality-14 finished in 3228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||(p1&&(p1 U X(p1))))))'
[2023-03-17 11:35:22] [INFO ] Flatten gal took : 4 ms
[2023-03-17 11:35:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-17 11:35:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 43 transitions and 128 arcs took 1 ms.
Total runtime 29473 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RefineWMG-PT-010011
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

BK_STOP 1679052954364

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 RefineWMG-PT-010011-LTLCardinality-01
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-010011-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
RefineWMG-PT-010011-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
RefineWMG-PT-010011-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 26/32 RefineWMG-PT-010011-LTLCardinality-01 3977222 m, 795444 m/sec, 6146577 t fired, .

Time elapsed: 5 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for RefineWMG-PT-010011-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-010011-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-010011-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
RefineWMG-PT-010011-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 RefineWMG-PT-010011-LTLCardinality-15
lola: time limit : 1795 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-010011-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-010011-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
RefineWMG-PT-010011-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1795 20/32 RefineWMG-PT-010011-LTLCardinality-15 2924809 m, 584961 m/sec, 6744707 t fired, .

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for RefineWMG-PT-010011-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-010011-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-010011-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
RefineWMG-PT-010011-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 RefineWMG-PT-010011-LTLCardinality-14
lola: time limit : 3580 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-010011-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-010011-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0
RefineWMG-PT-010011-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3580 27/32 RefineWMG-PT-010011-LTLCardinality-14 4224778 m, 844955 m/sec, 5821637 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for RefineWMG-PT-010011-LTLCardinality-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RefineWMG-PT-010011-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-010011-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0
RefineWMG-PT-010011-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RefineWMG-PT-010011-LTLCardinality-01: LTL unknown AGGR
RefineWMG-PT-010011-LTLCardinality-14: LTL unknown AGGR
RefineWMG-PT-010011-LTLCardinality-15: LTL unknown AGGR


Time elapsed: 30 secs. Pages in use: 32

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="RefineWMG-PT-010011"
export BK_EXAMINATION="LTLCardinality"
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 RefineWMG-PT-010011, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r327-tall-167889199800587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010011.tgz
mv RefineWMG-PT-010011 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;