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.r489-tall-167912706600324.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 SwimmingPool-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706600324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.5K Feb 26 03:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 03:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:44 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.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:47 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-01-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679236305822

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SwimmingPool-PT-01
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 14:31:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 14:31:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 14:31:47] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-19 14:31:47] [INFO ] Transformed 9 places.
[2023-03-19 14:31:47] [INFO ] Transformed 7 transitions.
[2023-03-19 14:31:47] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA SwimmingPool-PT-01-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-LTLFireability-01 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 14 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 14:31:47] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-19 14:31:47] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-19 14:31:47] [INFO ] Invariant cache hit.
[2023-03-19 14:31:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-19 14:31:47] [INFO ] Invariant cache hit.
[2023-03-19 14:31:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 14:31:48] [INFO ] Flatten gal took : 14 ms
[2023-03-19 14:31:48] [INFO ] Flatten gal took : 2 ms
[2023-03-19 14:31:48] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 825 steps, including 0 resets, run visited all 13 properties in 16 ms. (steps per millisecond=51 )
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(p0)||(p1 U (p2||G(p1)))) U (!p1&&(G(p0)||(p1 U (p2||G(p1))))))))'
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 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:31:48] [INFO ] Invariant cache hit.
[2023-03-19 14:31:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 14:31:48] [INFO ] Invariant cache hit.
[2023-03-19 14:31:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-19 14:31:48] [INFO ] Invariant cache hit.
[2023-03-19 14:31:48] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), true, (OR p1 (AND (NOT p0) (NOT p2))), (OR p1 (AND (NOT p0) (NOT p2))), (OR (NOT p2) p1)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s8 1)), p1:(LT s2 1), p2:(AND (NOT (AND (GEQ s3 1) (GEQ s7 1))) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-02 finished in 452 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((G(p1)&&(!p2 U (p3||G(!p2)))))||p0)))'
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 14:31:48] [INFO ] Invariant cache hit.
[2023-03-19 14:31:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 14:31:48] [INFO ] Invariant cache hit.
[2023-03-19 14:31:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-19 14:31:48] [INFO ] Invariant cache hit.
[2023-03-19 14:31:48] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p0) p2 (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3)))]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (AND (NOT p3) p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p3), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1 p3) (AND p1 (NOT p3) (NOT p2))), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s8 1)), p1:(OR (LT s3 1) (LT s7 1) (LT s1 1) (LT s8 1)), p3:(AND (NOT (AND (GEQ s3 1) (GEQ s7 1))) (NOT (AND (GEQ s1 1) (GEQ s8 1))))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-03 finished in 249 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)&&X(G(p1)))))'
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 14:31:49] [INFO ] Invariant cache hit.
[2023-03-19 14:31:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 14:31:49] [INFO ] Invariant cache hit.
[2023-03-19 14:31:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 14:31:49] [INFO ] Invariant cache hit.
[2023-03-19 14:31:49] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s2 1), p1:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-04 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 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.
[2023-03-19 14:31:49] [INFO ] Invariant cache hit.
[2023-03-19 14:31:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 14:31:49] [INFO ] Invariant cache hit.
[2023-03-19 14:31:49] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-19 14:31:49] [INFO ] Invariant cache hit.
[2023-03-19 14:31:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-05 finished in 282 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) U !p1) U p2) U (X(p3)||(F(p2)&&p4))))'
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 14:31:49] [INFO ] Invariant cache hit.
[2023-03-19 14:31:49] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 14:31:49] [INFO ] Invariant cache hit.
[2023-03-19 14:31:49] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-19 14:31:49] [INFO ] Invariant cache hit.
[2023-03-19 14:31:49] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 532 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p3)), (AND p1 p2 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), p1, (NOT p2), (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p4), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p4) (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(AND p4 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p4) (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p4 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(NOT p2), acceptance={} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p4:(AND (GEQ s1 1) (GEQ s8 1)), p2:(AND (GEQ s1 1) (GEQ s8 1)), p1:(LT s2 1), p0:(GEQ s6 1), p3:(LT s4 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 148 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 p4) (NOT p2) p1 p0 p3), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p2) p1 (NOT p0) (NOT p3)))), (X (NOT (AND p4 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p2) p1 (NOT p3)))), (X (NOT (AND p2 p1 (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p2) (NOT p3)))), (X (NOT (AND p2 p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p4 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(X (NOT (AND p2 p1 (NOT p3))))
Knowledge based reduction with 27 factoid took 905 ms. Reduced automaton from 10 states, 24 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SwimmingPool-PT-01-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-01-LTLFireability-06 finished in 1951 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(X(X(G((!p1||F(!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 14:31:51] [INFO ] Invariant cache hit.
[2023-03-19 14:31:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 14:31:51] [INFO ] Invariant cache hit.
[2023-03-19 14:31:51] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 14:31:51] [INFO ] Invariant cache hit.
[2023-03-19 14:31:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 574 ms :[(OR p0 (AND p1 p2)), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (OR (AND p1 p2) (AND p0 p2))]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 9}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 11}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=6 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 8}, { cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=7 dest: 9}, { cond=(AND p0 p1 p2), acceptance={0} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=8 dest: 11}, { cond=(AND p0 p1 p2), acceptance={0} source=8 dest: 12}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=9 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=9 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=10 dest: 7}, { cond=(AND p0 p2), acceptance={0} source=10 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=11 dest: 9}, { cond=(AND p0 p2), acceptance={0} source=11 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=12 dest: 11}, { cond=(AND p0 p2), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(LT s4 1), p1:(GEQ s6 1), p2:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3101 reset in 155 ms.
Stack based approach found an accepted trace after 421 steps with 14 reset with depth 68 and stack size 68 in 1 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-07 finished in 842 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((!p0&&(!p1||(p2 U (p0||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 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:31:52] [INFO ] Invariant cache hit.
[2023-03-19 14:31:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 14:31:52] [INFO ] Invariant cache hit.
[2023-03-19 14:31:52] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-19 14:31:52] [INFO ] Invariant cache hit.
[2023-03-19 14:31:52] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 217 ms :[p2, (OR p0 (AND p1 p2)), (AND p2 (NOT p0)), (OR p0 (AND p1 p2)), (OR p0 (AND p1 p2)), true]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(AND (GEQ s0 1) (GEQ s7 1)), p0:(GEQ s6 1), p1:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-09 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 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 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:31:52] [INFO ] Invariant cache hit.
[2023-03-19 14:31:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 14:31:52] [INFO ] Invariant cache hit.
[2023-03-19 14:31:52] [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 14:31:52] [INFO ] Invariant cache hit.
[2023-03-19 14:31:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10239 reset in 69 ms.
Product exploration explored 100000 steps with 10230 reset in 119 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-19 14:31:53] [INFO ] Invariant cache hit.
[2023-03-19 14:31:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 14:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:31:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-19 14:31:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:31:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 14:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:31:53] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-19 14:31:53] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-19 14:31:53] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 7 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-19 14:31:53] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 14:31:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 14:31:53] [INFO ] Invariant cache hit.
[2023-03-19 14:31:53] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 14:31:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:31:53] [INFO ] Invariant cache hit.
[2023-03-19 14:31:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 6/9 places, 4/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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-19 14:31:54] [INFO ] Invariant cache hit.
[2023-03-19 14:31:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 14:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:31:54] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-19 14:31:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:31:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 14:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:31:54] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-19 14:31:54] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 14:31:54] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25071 reset in 70 ms.
Product exploration explored 100000 steps with 25011 reset in 70 ms.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-19 14:31:54] [INFO ] Invariant cache hit.
[2023-03-19 14:31:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 14:31:54] [INFO ] Invariant cache hit.
[2023-03-19 14:31:54] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-19 14:31:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:31:54] [INFO ] Invariant cache hit.
[2023-03-19 14:31:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 6/6 places, 4/4 transitions.
Treatment of property SwimmingPool-PT-01-LTLFireability-10 finished in 1746 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))&&F(p1))))'
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.
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
Applied a total of 2 rules in 0 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 14:31:54] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 14:31:54] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 14:31:54] [INFO ] Invariant cache hit.
[2023-03-19 14:31:54] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-19 14:31:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:31:54] [INFO ] Invariant cache hit.
[2023-03-19 14:31:54] [INFO ] Dead Transitions using invariants and state equation in 20 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 65 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), 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={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s2 1), p1:(AND (GEQ s0 1) (GEQ s6 1) (GEQ s3 1))], 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 70 reset in 149 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-11 finished in 347 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||G(F(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.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 14:31:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 14:31:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 14:31:54] [INFO ] Invariant cache hit.
[2023-03-19 14:31:54] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 14:31:54] [INFO ] Invariant cache hit.
[2023-03-19 14:31:54] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 167 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4727 reset in 67 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA SwimmingPool-PT-01-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-12 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((!p0&&G(!p1)&&X(F(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 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-19 14:31:55] [INFO ] Invariant cache hit.
[2023-03-19 14:31:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 14:31:55] [INFO ] Invariant cache hit.
[2023-03-19 14:31:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 14:31:55] [INFO ] Invariant cache hit.
[2023-03-19 14:31:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 186 ms :[p1, (OR (NOT p2) p1), (OR (NOT p2) p0 p1), (OR (NOT p2) p0 p1), true]
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LT s4 1), p2:(AND (GEQ s0 1) (GEQ s7 1)), p0:(LT s2 1)], 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-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-LTLFireability-15 finished in 298 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)))'
Found a Shortening insensitive property : SwimmingPool-PT-01-LTLFireability-10
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LI_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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 5 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-19 14:31:55] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 14:31:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 14:31:55] [INFO ] Invariant cache hit.
[2023-03-19 14:31:55] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-19 14:31:55] [INFO ] Invariant cache hit.
[2023-03-19 14:31:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 77 ms. Remains : 6/9 places, 4/7 transitions.
Running random walk in product with property : SwimmingPool-PT-01-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 24979 reset in 54 ms.
Product exploration explored 100000 steps with 24961 reset in 59 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-19 14:31:56] [INFO ] Invariant cache hit.
[2023-03-19 14:31:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 14:31:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:31:56] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-19 14:31:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:31:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 14:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:31:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-19 14:31:56] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 14:31:56] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-19 14:31:56] [INFO ] Invariant cache hit.
[2023-03-19 14:31:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 14:31:56] [INFO ] Invariant cache hit.
[2023-03-19 14:31:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-19 14:31:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:31:56] [INFO ] Invariant cache hit.
[2023-03-19 14:31:56] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 6/6 places, 4/4 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-19 14:31:56] [INFO ] Invariant cache hit.
[2023-03-19 14:31:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 14:31:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:31:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-19 14:31:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:31:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 14:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:31:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-19 14:31:56] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 14:31:56] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24957 reset in 48 ms.
Product exploration explored 100000 steps with 24993 reset in 72 ms.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-19 14:31:57] [INFO ] Invariant cache hit.
[2023-03-19 14:31:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 14:31:57] [INFO ] Invariant cache hit.
[2023-03-19 14:31:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-19 14:31:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 14:31:57] [INFO ] Invariant cache hit.
[2023-03-19 14:31:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 6/6 places, 4/4 transitions.
Treatment of property SwimmingPool-PT-01-LTLFireability-10 finished in 1639 ms.
[2023-03-19 14:31:57] [INFO ] Flatten gal took : 1 ms
[2023-03-19 14:31:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 14:31:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 7 transitions and 20 arcs took 1 ms.
Total runtime 9888 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1159/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SwimmingPool-PT-01-LTLFireability-10

BK_STOP 1679236318167

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SwimmingPool-PT-01-LTLFireability-10
ltl formula formula --ltl=/tmp/1159/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 9 places, 7 transitions and 20 arcs
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/1159/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1159/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1159/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1159/ltl_0_
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)

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-01"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is SwimmingPool-PT-01, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r489-tall-167912706600324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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