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.r487-tall-167912702900339.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is SwimmingPool-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702900339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.6K Feb 26 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 03:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 03:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-03-LTLCardinality-00
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-01
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-02
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-03
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-04
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-05
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-06
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-07
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-08
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-09
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-10
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-11
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-12
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-13
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-14
FORMULA_NAME SwimmingPool-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679186289938

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SwimmingPool-PT-03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 00:38:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 00:38:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:38:11] [INFO ] Load time of PNML (sax parser for PT used): 16 ms
[2023-03-19 00:38:11] [INFO ] Transformed 9 places.
[2023-03-19 00:38:11] [INFO ] Transformed 7 transitions.
[2023-03-19 00:38:11] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 69 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 1 formulas.
FORMULA SwimmingPool-PT-03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 7 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 00:38:11] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-19 00:38:11] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-19 00:38:11] [INFO ] Invariant cache hit.
[2023-03-19 00:38:11] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-19 00:38:11] [INFO ] Invariant cache hit.
[2023-03-19 00:38:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 00:38:12] [INFO ] Flatten gal took : 443 ms
[2023-03-19 00:38:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 00:38:12] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 1349 steps, including 0 resets, run visited all 30 properties in 20 ms. (steps per millisecond=67 )
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((p0||F((p1&&F(p2))))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:13] [INFO ] Invariant cache hit.
[2023-03-19 00:38:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 00:38:13] [INFO ] Invariant cache hit.
[2023-03-19 00:38:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 00:38:13] [INFO ] Invariant cache hit.
[2023-03-19 00:38:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p2:(LEQ s8 s3), p1:(LEQ s7 s1), p0:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 52 reset in 205 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 2 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-00 finished in 746 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(G(p0)) U p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 6 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-19 00:38:13] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 00:38:13] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 00:38:13] [INFO ] Invariant cache hit.
[2023-03-19 00:38:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 00:38:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 00:38:14] [INFO ] Invariant cache hit.
[2023-03-19 00:38:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s5 s4), p0:(OR (LEQ s5 s4) (LEQ s2 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 122 ms.
Stack based approach found an accepted trace after 4599 steps with 2 reset with depth 2400 and stack size 2231 in 13 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-01 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U G(p2))||F(p3)))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 00:38:14] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 00:38:14] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 00:38:14] [INFO ] Invariant cache hit.
[2023-03-19 00:38:14] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 00:38:14] [INFO ] Invariant cache hit.
[2023-03-19 00:38:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s2 s3), p2:(LEQ s1 s2), p1:(OR (LEQ 1 s4) (LEQ s1 s2)), p3:(LEQ s4 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15 reset in 135 ms.
Product exploration explored 100000 steps with 12 reset in 117 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 p2 p1 p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 692 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 00:38:16] [INFO ] Invariant cache hit.
[2023-03-19 00:38:16] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-19 00:38:16] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1 p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 p2 (NOT p3))), (F (AND p1 (NOT p3) (NOT p0))), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 19 factoid took 873 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:17] [INFO ] Invariant cache hit.
[2023-03-19 00:38:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 00:38:17] [INFO ] Invariant cache hit.
[2023-03-19 00:38:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-19 00:38:17] [INFO ] Invariant cache hit.
[2023-03-19 00:38:17] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 9/9 places, 7/7 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 p1 p3 p0 p2), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (X (OR p1 p3))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:38:17] [INFO ] Invariant cache hit.
[2023-03-19 00:38:17] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:38:17] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p3 p0 p2), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (X (OR p1 p3))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (G (OR p1 p3))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND p1 (NOT p0) (NOT p3)))]
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 18 reset in 75 ms.
Product exploration explored 100000 steps with 24 reset in 83 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 00:38:19] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 00:38:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9 places, 7/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 00:38:19] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 00:38:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 00:38:19] [INFO ] Invariant cache hit.
[2023-03-19 00:38:19] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-19 00:38:19] [INFO ] Invariant cache hit.
[2023-03-19 00:38:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 9/9 places, 7/7 transitions.
Treatment of property SwimmingPool-PT-03-LTLCardinality-02 finished in 4914 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((X(p0)&&F((G(F(p1))||(F(p1)&&X(p2))))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:19] [INFO ] Invariant cache hit.
[2023-03-19 00:38:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 00:38:19] [INFO ] Invariant cache hit.
[2023-03-19 00:38:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-19 00:38:19] [INFO ] Invariant cache hit.
[2023-03-19 00:38:19] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT s5 s0), p0:(GT s8 s5), p2:(GT 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 548 reset in 76 ms.
Stack based approach found an accepted trace after 176 steps with 6 reset with depth 116 and stack size 116 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-03 finished in 398 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)||G(p1))) U G(!p0)) U p2))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 4 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-19 00:38:19] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 00:38:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 00:38:19] [INFO ] Invariant cache hit.
[2023-03-19 00:38:19] [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-19 00:38:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:38:19] [INFO ] Invariant cache hit.
[2023-03-19 00:38:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 3 s2), p0:(GT 3 s5), p1:(GT 3 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Stack based approach found an accepted trace after 1383 steps with 0 reset with depth 1384 and stack size 1354 in 1 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-04 finished in 314 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||F(p1))&&G(p2))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 00:38:19] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 00:38:19] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 00:38:19] [INFO ] Invariant cache hit.
[2023-03-19 00:38:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-19 00:38:20] [INFO ] Invariant cache hit.
[2023-03-19 00:38:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(LEQ 1 s5), p0:(GT s7 s4), p1:(GT 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-06 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1&&(p1 U (!p0||G(!p1))))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-19 00:38:20] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:38:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 00:38:20] [INFO ] Invariant cache hit.
[2023-03-19 00:38:20] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-19 00:38:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:38:20] [INFO ] Invariant cache hit.
[2023-03-19 00:38:20] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 125 ms :[p1, true, (OR (NOT p1) p0), (AND p1 p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 2 s3), p0:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3369 reset in 88 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-07 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 00:38:20] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:38:20] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 00:38:20] [INFO ] Invariant cache hit.
[2023-03-19 00:38:20] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-19 00:38:20] [INFO ] Invariant cache hit.
[2023-03-19 00:38:20] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1083 steps with 0 reset in 4 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-08 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:20] [INFO ] Invariant cache hit.
[2023-03-19 00:38:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 00:38:20] [INFO ] Invariant cache hit.
[2023-03-19 00:38:20] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-19 00:38:20] [INFO ] Invariant cache hit.
[2023-03-19 00:38:20] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 1 s8) (GT 3 s6))], 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 23 reset in 71 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-09 finished in 210 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(G(p0))&&G(p1))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:20] [INFO ] Invariant cache hit.
[2023-03-19 00:38:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 00:38:21] [INFO ] Invariant cache hit.
[2023-03-19 00:38:21] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 00:38:21] [INFO ] Invariant cache hit.
[2023-03-19 00:38:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s8 s4), p0:(LEQ s6 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-10 finished in 234 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((G(F(p1))||p0))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:21] [INFO ] Invariant cache hit.
[2023-03-19 00:38:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 00:38:21] [INFO ] Invariant cache hit.
[2023-03-19 00:38:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-19 00:38:21] [INFO ] Invariant cache hit.
[2023-03-19 00:38:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s0 s1) (LEQ s3 s6)), p1:(AND (LEQ s0 s1) (LEQ 3 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 62 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 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SwimmingPool-PT-03-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-03-LTLCardinality-11 finished in 417 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((G((p0 U p1)) U p2))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:21] [INFO ] Invariant cache hit.
[2023-03-19 00:38:21] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 00:38:21] [INFO ] Invariant cache hit.
[2023-03-19 00:38:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-19 00:38:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:38:21] [INFO ] Invariant cache hit.
[2023-03-19 00:38:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LEQ 3 s7) (LEQ 2 s6) (LEQ s1 s8)), p1:(LEQ 3 s7), p0:(LEQ s1 s8)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Stack based approach found an accepted trace after 3727 steps with 0 reset with depth 3728 and stack size 3681 in 6 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-12 finished in 416 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)&&(p0||G(p1))) U X(G(!p0))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:22] [INFO ] Invariant cache hit.
[2023-03-19 00:38:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 00:38:22] [INFO ] Invariant cache hit.
[2023-03-19 00:38:22] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-19 00:38:22] [INFO ] Invariant cache hit.
[2023-03-19 00:38:22] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, false, (AND (NOT p1) p0), p0, true, (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(GT s8 s7), p1:(LEQ 1 s1)], 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 33420 reset in 72 ms.
Stack based approach found an accepted trace after 127 steps with 42 reset with depth 8 and stack size 8 in 1 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-13 finished in 357 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(G(p0))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 00:38:22] [INFO ] Invariant cache hit.
[2023-03-19 00:38:22] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 00:38:22] [INFO ] Invariant cache hit.
[2023-03-19 00:38:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-19 00:38:22] [INFO ] Invariant cache hit.
[2023-03-19 00:38:22] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-14 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-19 00:38:22] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 00:38:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 00:38:22] [INFO ] Invariant cache hit.
[2023-03-19 00:38:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-19 00:38:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:38:22] [INFO ] Invariant cache hit.
[2023-03-19 00:38:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s4 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 88 reset in 60 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLCardinality-15 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U G(p2))||F(p3)))))'
Found a Lengthening insensitive property : SwimmingPool-PT-03-LTLCardinality-02
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
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 0 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-19 00:38:23] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 00:38:23] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 00:38:23] [INFO ] Invariant cache hit.
[2023-03-19 00:38:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-19 00:38:23] [INFO ] Invariant cache hit.
[2023-03-19 00:38:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 80 ms. Remains : 7/9 places, 5/7 transitions.
Running random walk in product with property : SwimmingPool-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1 s2), p2:(LEQ s0 s1), p1:(OR (LEQ 1 s3) (LEQ s0 s1)), p3:(LEQ s3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 45 reset in 82 ms.
Product exploration explored 100000 steps with 44 reset in 89 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 p2 p1 p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 809 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10024 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=911 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 00:38:24] [INFO ] Invariant cache hit.
[2023-03-19 00:38:24] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-19 00:38:24] [INFO ] After 15ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1 p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 p2 (NOT p3))), (F (AND p1 (NOT p3) (NOT p0))), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 19 factoid took 881 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-19 00:38:25] [INFO ] Invariant cache hit.
[2023-03-19 00:38:25] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 00:38:25] [INFO ] Invariant cache hit.
[2023-03-19 00:38:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-19 00:38:25] [INFO ] Invariant cache hit.
[2023-03-19 00:38:25] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 7/7 places, 5/5 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 p1 p3 p0 p2), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (X (OR p1 p3))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 263 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND p1 (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-19 00:38:26] [INFO ] Invariant cache hit.
[2023-03-19 00:38:26] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:38:26] [INFO ] After 14ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p3 p0 p2), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (X (OR p1 p3))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (G (OR p1 p3))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND p1 (NOT p0) (NOT p3)))]
Knowledge based reduction with 8 factoid took 375 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 44 reset in 72 ms.
Stack based approach found an accepted trace after 4495 steps with 2 reset with depth 2828 and stack size 2553 in 3 ms.
Treatment of property SwimmingPool-PT-03-LTLCardinality-02 finished in 4182 ms.
FORMULA SwimmingPool-PT-03-LTLCardinality-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 00:38:27] [INFO ] Flatten gal took : 1 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 15680 ms.
ITS solved all properties within timeout

BK_STOP 1679186308024

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="SwimmingPool-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is SwimmingPool-PT-03, 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 r487-tall-167912702900339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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