About the Execution of LTSMin+red for RefineWMG-PT-010011
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
774.960 | 35032.00 | 60192.00 | 572.00 | FFTTFFFFFFFFFF?? | normal |
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.r329-tall-167889202200587.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RefineWMG-PT-010011, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202200587
=====================================================================
--------------------
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 1679150753348
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-010011
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 14:45:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 14:45:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 14:45:55] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-18 14:45:55] [INFO ] Transformed 54 places.
[2023-03-18 14:45:55] [INFO ] Transformed 43 transitions.
[2023-03-18 14:45:55] [INFO ] Parsed PT model containing 54 places and 43 transitions and 128 arcs in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 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 10 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 14:45:55] [INFO ] Computed 22 place invariants in 8 ms
[2023-03-18 14:45:55] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
[2023-03-18 14:45:55] [INFO ] Invariant cache hit.
[2023-03-18 14:45:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 14:45:55] [INFO ] Invariant cache hit.
[2023-03-18 14:45:55] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-18 14:45:55] [INFO ] Invariant cache hit.
[2023-03-18 14:45:55] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 54/54 places, 43/43 transitions.
Support contains 35 out of 54 places after structural reductions.
[2023-03-18 14:45:55] [INFO ] Flatten gal took : 20 ms
[2023-03-18 14:45:55] [INFO ] Flatten gal took : 7 ms
[2023-03-18 14:45:55] [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 10005 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 30) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 14:45:56] [INFO ] Invariant cache hit.
[2023-03-18 14:45:56] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-18 14:45:56] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 14:45:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-18 14:45:56] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 14:45:56] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-18 14:45:56] [INFO ] After 553ms 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 255 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=127 )
Parikh walk visited 8 properties in 53 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 4 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 14:45:57] [INFO ] Invariant cache hit.
[2023-03-18 14:45:57] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-18 14:45:57] [INFO ] Invariant cache hit.
[2023-03-18 14:45:57] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 14:45:57] [INFO ] Invariant cache hit.
[2023-03-18 14:45:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-18 14:45:57] [INFO ] Invariant cache hit.
[2023-03-18 14:45:57] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 290 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 3 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-00 finished in 602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((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-18 14:45:57] [INFO ] Invariant cache hit.
[2023-03-18 14:45:58] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
[2023-03-18 14:45:58] [INFO ] Invariant cache hit.
[2023-03-18 14:45:58] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 14:45:58] [INFO ] Invariant cache hit.
[2023-03-18 14:45:58] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-18 14:45:58] [INFO ] Invariant cache hit.
[2023-03-18 14:45:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 275 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 6 reset in 491 ms.
Product exploration explored 100000 steps with 74 reset in 436 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 615 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 228 ms :[(AND p1 (NOT p0)), p1, (AND (NOT p0) p1), (AND p0 p1), true, p1, (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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-18 14:46:00] [INFO ] Invariant cache hit.
[2023-03-18 14:46:00] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-18 14:46:00] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 14:46:00] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-18 14:46:00] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 14:46:00] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 14:46:00] [INFO ] After 148ms 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 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.
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 710 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 130 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Stuttering acceptance computed with spot in 156 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-18 14:46:01] [INFO ] Invariant cache hit.
[2023-03-18 14:46:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-18 14:46:01] [INFO ] Invariant cache hit.
[2023-03-18 14:46:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 14:46:01] [INFO ] Invariant cache hit.
[2023-03-18 14:46:01] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-18 14:46:01] [INFO ] Invariant cache hit.
[2023-03-18 14:46: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 188 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 355 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 171 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) 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-18 14:46:02] [INFO ] Invariant cache hit.
[2023-03-18 14:46:02] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 14:46:02] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 14:46:02] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 14:46:02] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 14:46:02] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 14:46:02] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 157 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 2 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 364 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 150 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Stuttering acceptance computed with spot in 157 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Stuttering acceptance computed with spot in 169 ms :[(AND p1 (NOT p0)), p1, p1, true, p1]
Product exploration explored 100000 steps with 13 reset in 204 ms.
Product exploration explored 100000 steps with 39 reset in 276 ms.
Applying partial POR strategy [false, true, true, true, false]
Stuttering acceptance computed with spot in 190 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 7 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 15 ms. Remains 34 /54 variables (removed 20) and now considering 24/43 (removed 19) transitions.
// Phase 1: matrix 24 rows 34 cols
[2023-03-18 14:46:04] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-18 14:46:04] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-18 14:46:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 14:46:04] [INFO ] Invariant cache hit.
[2023-03-18 14:46:04] [INFO ] Dead Transitions using invariants and state equation in 36 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 95 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 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-18 14:46:04] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-18 14:46:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-18 14:46:04] [INFO ] Invariant cache hit.
[2023-03-18 14:46:04] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-18 14:46:04] [INFO ] Invariant cache hit.
[2023-03-18 14:46:04] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-18 14:46:04] [INFO ] Invariant cache hit.
[2023-03-18 14:46:04] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 54/54 places, 43/43 transitions.
Treatment of property RefineWMG-PT-010011-LTLCardinality-01 finished in 6677 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 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 14:46:04] [INFO ] Invariant cache hit.
[2023-03-18 14:46:04] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-18 14:46:04] [INFO ] Invariant cache hit.
[2023-03-18 14:46:04] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 14:46:04] [INFO ] Invariant cache hit.
[2023-03-18 14:46:04] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-18 14:46:04] [INFO ] Invariant cache hit.
[2023-03-18 14:46:04] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 178 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 292 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-04 finished in 365 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 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 14:46:04] [INFO ] Invariant cache hit.
[2023-03-18 14:46:05] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2023-03-18 14:46:05] [INFO ] Invariant cache hit.
[2023-03-18 14:46:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 14:46:05] [INFO ] Invariant cache hit.
[2023-03-18 14:46:05] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-18 14:46:05] [INFO ] Invariant cache hit.
[2023-03-18 14:46:05] [INFO ] Dead Transitions using invariants and state equation in 36 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 76 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 2914 reset in 177 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-05 finished in 421 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 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 14:46:05] [INFO ] Invariant cache hit.
[2023-03-18 14:46:05] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-18 14:46:05] [INFO ] Invariant cache hit.
[2023-03-18 14:46:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 14:46:05] [INFO ] Invariant cache hit.
[2023-03-18 14:46:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-18 14:46:05] [INFO ] Invariant cache hit.
[2023-03-18 14:46:05] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 158 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 223 ms.
Stack based approach found an accepted trace after 11666 steps with 0 reset with depth 11667 and stack size 11206 in 32 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-06 finished in 603 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 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 14:46:06] [INFO ] Invariant cache hit.
[2023-03-18 14:46:06] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-18 14:46:06] [INFO ] Invariant cache hit.
[2023-03-18 14:46:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 14:46:06] [INFO ] Invariant cache hit.
[2023-03-18 14:46:06] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-18 14:46:06] [INFO ] Invariant cache hit.
[2023-03-18 14:46:06] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 67 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 1282 reset in 231 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-08 finished in 498 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 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 14:46:06] [INFO ] Invariant cache hit.
[2023-03-18 14:46:06] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-18 14:46:06] [INFO ] Invariant cache hit.
[2023-03-18 14:46:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 14:46:06] [INFO ] Invariant cache hit.
[2023-03-18 14:46:06] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-18 14:46:06] [INFO ] Invariant cache hit.
[2023-03-18 14:46:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 235 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 4 reset in 209 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-09 finished in 624 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 9 ms. Remains 15 /54 variables (removed 39) and now considering 12/43 (removed 31) transitions.
// Phase 1: matrix 12 rows 15 cols
[2023-03-18 14:46:07] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 14:46:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:07] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:07] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-18 14:46:07] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:07] [INFO ] Dead Transitions using invariants and state equation in 27 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 131 ms. Remains : 15/54 places, 12/43 transitions.
Stuttering acceptance computed with spot in 77 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 85 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 229 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 17 ms. Remains 20 /54 variables (removed 34) and now considering 17/43 (removed 26) transitions.
// Phase 1: matrix 17 rows 20 cols
[2023-03-18 14:46:07] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-18 14:46:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:07] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-18 14:46:07] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:07] [INFO ] Dead Transitions using invariants and state equation in 26 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 158 ms. Remains : 20/54 places, 17/43 transitions.
Stuttering acceptance computed with spot in 91 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 272 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 1 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 9 ms. Remains 13 /54 variables (removed 41) and now considering 11/43 (removed 32) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-18 14:46:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 14:46:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-18 14:46:07] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:07] [INFO ] Dead Transitions using invariants and state equation in 23 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 131 ms. Remains : 13/54 places, 11/43 transitions.
Stuttering acceptance computed with spot in 155 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 16 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-010011-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010011-LTLCardinality-12 finished in 304 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-18 14:46:07] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-18 14:46:07] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-18 14:46:07] [INFO ] Invariant cache hit.
[2023-03-18 14:46:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 14:46:08] [INFO ] Invariant cache hit.
[2023-03-18 14:46:08] [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-18 14:46:08] [INFO ] Invariant cache hit.
[2023-03-18 14:46:08] [INFO ] Dead Transitions using invariants and state equation in 36 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 77 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 258 ms.
Product exploration explored 100000 steps with 0 reset in 257 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 290 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 67 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 356208 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 356208 steps, saw 267032 distinct states, run finished after 3002 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 14:46:12] [INFO ] Invariant cache hit.
[2023-03-18 14:46:12] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 14:46:12] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 14:46:12] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 14:46:12] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 14:46:12] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 14:46:12] [INFO ] After 115ms 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 182 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=30 )
Parikh walk visited 3 properties in 6 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 454 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 92 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 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 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 14:46:12] [INFO ] Invariant cache hit.
[2023-03-18 14:46:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2023-03-18 14:46:13] [INFO ] Invariant cache hit.
[2023-03-18 14:46:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 14:46:13] [INFO ] Invariant cache hit.
[2023-03-18 14:46:13] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-18 14:46:13] [INFO ] Invariant cache hit.
[2023-03-18 14:46:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 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 224 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 69 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) 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
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
Interrupted probabilistic random walk after 359941 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 359941 steps, saw 269864 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 14:46:16] [INFO ] Invariant cache hit.
[2023-03-18 14:46:16] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-18 14:46:16] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 14:46:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 14:46:16] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 14:46:16] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 14:46:16] [INFO ] After 90ms 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 182 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 341 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 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 234 ms.
Product exploration explored 100000 steps with 0 reset in 301 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 72 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 8 ms. Remains 38 /54 variables (removed 16) and now considering 28/43 (removed 15) transitions.
// Phase 1: matrix 28 rows 38 cols
[2023-03-18 14:46:17] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-18 14:46:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-18 14:46:18] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 14:46:18] [INFO ] Invariant cache hit.
[2023-03-18 14:46:18] [INFO ] Dead Transitions using invariants and state equation in 36 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 111 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 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-18 14:46:18] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-18 14:46:18] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-18 14:46:18] [INFO ] Invariant cache hit.
[2023-03-18 14:46:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 14:46:18] [INFO ] Invariant cache hit.
[2023-03-18 14:46:18] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-18 14:46:18] [INFO ] Invariant cache hit.
[2023-03-18 14:46:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 54/54 places, 43/43 transitions.
Treatment of property RefineWMG-PT-010011-LTLCardinality-14 finished in 10370 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-18 14:46:18] [INFO ] Invariant cache hit.
[2023-03-18 14:46:18] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-18 14:46:18] [INFO ] Invariant cache hit.
[2023-03-18 14:46:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 14:46:18] [INFO ] Invariant cache hit.
[2023-03-18 14:46:18] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-18 14:46:18] [INFO ] Invariant cache hit.
[2023-03-18 14:46:18] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 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 25072 reset in 169 ms.
Product exploration explored 100000 steps with 24983 reset in 196 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 147 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 235 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 10007 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 14:46:19] [INFO ] Invariant cache hit.
[2023-03-18 14:46:19] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 14:46:19] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 14:46:19] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 14:46:19] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 14:46:19] [INFO ] After 63ms 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 5 ms. (steps per millisecond=46 )
Parikh walk visited 2 properties in 5 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 246 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 176 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 171 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 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 14:46:20] [INFO ] Invariant cache hit.
[2023-03-18 14:46:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-18 14:46:20] [INFO ] Invariant cache hit.
[2023-03-18 14:46:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-18 14:46:20] [INFO ] Invariant cache hit.
[2023-03-18 14:46:20] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-18 14:46:20] [INFO ] Invariant cache hit.
[2023-03-18 14:46:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 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 176 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 186 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 10006 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=345 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 14:46:20] [INFO ] Invariant cache hit.
[2023-03-18 14:46:20] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 14:46:20] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 14:46:20] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 14:46:20] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 14:46:20] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 198 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=49 )
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 235 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 203 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 209 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 185 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 24906 reset in 155 ms.
Product exploration explored 100000 steps with 25059 reset in 158 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 428 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 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 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 12 ms. Remains 36 /54 variables (removed 18) and now considering 26/43 (removed 17) transitions.
// Phase 1: matrix 26 rows 36 cols
[2023-03-18 14:46:22] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 14:46:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-18 14:46:22] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 14:46:22] [INFO ] Invariant cache hit.
[2023-03-18 14:46:22] [INFO ] Dead Transitions using invariants and state equation in 31 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 94 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 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-18 14:46:22] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-18 14:46:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-18 14:46:22] [INFO ] Invariant cache hit.
[2023-03-18 14:46:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 14:46:22] [INFO ] Invariant cache hit.
[2023-03-18 14:46:22] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-18 14:46:22] [INFO ] Invariant cache hit.
[2023-03-18 14:46:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 54/54 places, 43/43 transitions.
Treatment of property RefineWMG-PT-010011-LTLCardinality-15 finished in 4665 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 293 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 4 ms. Remains 9 /54 variables (removed 45) and now considering 8/43 (removed 35) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 14:46:23] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-18 14:46:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-18 14:46:23] [INFO ] Invariant cache hit.
[2023-03-18 14:46:23] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-18 14:46:23] [INFO ] Invariant cache hit.
[2023-03-18 14:46:23] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-18 14:46:23] [INFO ] Invariant cache hit.
[2023-03-18 14:46:23] [INFO ] Dead Transitions using invariants and state equation in 19 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 202 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]]
Entered a terminal (fully accepting) state of product in 33856 steps with 2 reset in 62 ms.
Treatment of property RefineWMG-PT-010011-LTLCardinality-01 finished in 646 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 90 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 6 ms. Remains 13 /54 variables (removed 41) and now considering 12/43 (removed 31) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-18 14:46:23] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 14:46:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-18 14:46:23] [INFO ] Invariant cache hit.
[2023-03-18 14:46:24] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-18 14:46:24] [INFO ] Invariant cache hit.
[2023-03-18 14:46:24] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-18 14:46:24] [INFO ] Invariant cache hit.
[2023-03-18 14:46:24] [INFO ] Dead Transitions using invariants and state equation in 21 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 312 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 103 ms.
Product exploration explored 100000 steps with 0 reset in 124 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 308 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 66 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Finished Best-First random walk after 635 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=317 )
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 300 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 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 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 4 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-18 14:46:25] [INFO ] Invariant cache hit.
[2023-03-18 14:46:25] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-18 14:46:25] [INFO ] Invariant cache hit.
[2023-03-18 14:46:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 14:46:25] [INFO ] Invariant cache hit.
[2023-03-18 14:46:25] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 14:46:25] [INFO ] Invariant cache hit.
[2023-03-18 14:46:25] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 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 272 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 73 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Finished Best-First random walk after 610 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=305 )
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 384 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 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 130 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 78 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 1 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-18 14:46:26] [INFO ] Invariant cache hit.
[2023-03-18 14:46:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-18 14:46:26] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 14:46:26] [INFO ] Invariant cache hit.
[2023-03-18 14:46:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 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-18 14:46:26] [INFO ] Invariant cache hit.
[2023-03-18 14:46:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-18 14:46:26] [INFO ] Invariant cache hit.
[2023-03-18 14:46:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 14:46:26] [INFO ] Invariant cache hit.
[2023-03-18 14:46:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-18 14:46:26] [INFO ] Invariant cache hit.
[2023-03-18 14:46:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 13/13 places, 12/12 transitions.
Treatment of property RefineWMG-PT-010011-LTLCardinality-14 finished in 3371 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-18 14:46:27] [INFO ] Flatten gal took : 10 ms
[2023-03-18 14:46:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 14:46:27] [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 32105 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2040/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2040/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2040/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RefineWMG-PT-010011-LTLCardinality-01
Could not compute solution for formula : RefineWMG-PT-010011-LTLCardinality-14
Could not compute solution for formula : RefineWMG-PT-010011-LTLCardinality-15
BK_STOP 1679150788380
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name RefineWMG-PT-010011-LTLCardinality-01
ltl formula formula --ltl=/tmp/2040/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 43 transitions and 128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2040/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2040/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2040/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2040/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name RefineWMG-PT-010011-LTLCardinality-14
ltl formula formula --ltl=/tmp/2040/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 43 transitions and 128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2040/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2040/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2040/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2040/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RefineWMG-PT-010011-LTLCardinality-15
ltl formula formula --ltl=/tmp/2040/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 43 transitions and 128 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2040/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2040/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2040/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2040/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-010011"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r329-tall-167889202200587"
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 '
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 ;