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.r361-smll-167891811300332.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 SatelliteMemory-PT-X65535Y2048, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811300332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 12 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 5.5K 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 SatelliteMemory-PT-X65535Y2048-LTLFireability-00
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-01
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-02
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-03
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-04
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-05
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-06
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-07
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-08
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-09
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-10
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-11
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-12
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-13
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-14
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679212942147

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=SatelliteMemory-PT-X65535Y2048
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 08:02:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 08:02:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 08:02:24] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-19 08:02:24] [INFO ] Transformed 13 places.
[2023-03-19 08:02:24] [INFO ] Transformed 10 transitions.
[2023-03-19 08:02:24] [INFO ] Parsed PT model containing 13 places and 10 transitions and 40 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 13 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-19 08:02:25] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-19 08:02:25] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
[2023-03-19 08:02:25] [INFO ] Invariant cache hit.
[2023-03-19 08:02:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 08:02:25] [INFO ] Invariant cache hit.
[2023-03-19 08:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:25] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-19 08:02:25] [INFO ] Invariant cache hit.
[2023-03-19 08:02:25] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 10 out of 12 places after structural reductions.
[2023-03-19 08:02:25] [INFO ] Flatten gal took : 20 ms
[2023-03-19 08:02:25] [INFO ] Flatten gal took : 6 ms
[2023-03-19 08:02:25] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 837 ms. (steps per millisecond=11 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 08:02:26] [INFO ] Invariant cache hit.
[2023-03-19 08:02:26] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-19 08:02:26] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-19 08:02:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-19 08:02:27] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-19 08:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:27] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-19 08:02:27] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 08:02:27] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 6003 ms.
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 17 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-19 08:02:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 08:02:33] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 10/12 places, 8/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Finished probabilistic random walk after 790934 steps, run visited all 2 properties in 1008 ms. (steps per millisecond=784 )
Probabilistic random walk after 790934 steps, saw 458006 distinct states, run finished after 1008 ms. (steps per millisecond=784 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-19 08:02:34] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 08:02:34] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-19 08:02:34] [INFO ] Invariant cache hit.
[2023-03-19 08:02:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 08:02:34] [INFO ] Invariant cache hit.
[2023-03-19 08:02:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:34] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-19 08:02:34] [INFO ] Invariant cache hit.
[2023-03-19 08:02:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s8 1)) (AND (GEQ s3 1) (GEQ s9 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 33278 reset in 322 ms.
Stack based approach found an accepted trace after 13 steps with 5 reset with depth 3 and stack size 3 in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-00 finished in 786 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)||G(F(!p1)))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-19 08:02:35] [INFO ] Invariant cache hit.
[2023-03-19 08:02:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-19 08:02:35] [INFO ] Invariant cache hit.
[2023-03-19 08:02:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 08:02:35] [INFO ] Invariant cache hit.
[2023-03-19 08:02:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:35] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 08:02:35] [INFO ] Invariant cache hit.
[2023-03-19 08:02:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, false, p1]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s5 65535), p1:(AND (GEQ s3 1) (GEQ s9 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-01 finished in 473 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(G(p1)))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-19 08:02:35] [INFO ] Invariant cache hit.
[2023-03-19 08:02:35] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-19 08:02:35] [INFO ] Invariant cache hit.
[2023-03-19 08:02:35] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 08:02:35] [INFO ] Invariant cache hit.
[2023-03-19 08:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:36] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-19 08:02:36] [INFO ] Invariant cache hit.
[2023-03-19 08:02:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s2 1)), p1:(OR (LT s0 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23703 reset in 192 ms.
Stack based approach found an accepted trace after 14 steps with 3 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-02 finished in 618 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))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 3 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-19 08:02:36] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 08:02:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-19 08:02:36] [INFO ] Invariant cache hit.
[2023-03-19 08:02:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 08:02:36] [INFO ] Invariant cache hit.
[2023-03-19 08:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:36] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-19 08:02:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 08:02:36] [INFO ] Invariant cache hit.
[2023-03-19 08:02:36] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 61439) (GEQ s4 61439))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-03 finished in 217 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((F(p1)&&p0))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-19 08:02:36] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 08:02:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-19 08:02:36] [INFO ] Invariant cache hit.
[2023-03-19 08:02:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 08:02:36] [INFO ] Invariant cache hit.
[2023-03-19 08:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:36] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 08:02:36] [INFO ] Invariant cache hit.
[2023-03-19 08:02:36] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s3 61439) (GEQ s5 61439)), p0:(AND (GEQ s0 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-05 finished in 450 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((X(X(!p0))||F(p1)))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-19 08:02:37] [INFO ] Invariant cache hit.
[2023-03-19 08:02:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-19 08:02:37] [INFO ] Invariant cache hit.
[2023-03-19 08:02:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 08:02:37] [INFO ] Invariant cache hit.
[2023-03-19 08:02:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:37] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 08:02:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:02:37] [INFO ] Invariant cache hit.
[2023-03-19 08:02:37] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3193 reset in 116 ms.
Product exploration explored 100000 steps with 3126 reset in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 261 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-19 08:02:38] [INFO ] Invariant cache hit.
[2023-03-19 08:02:38] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-19 08:02:38] [INFO ] Invariant cache hit.
[2023-03-19 08:02:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 08:02:38] [INFO ] Invariant cache hit.
[2023-03-19 08:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:38] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 08:02:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:02:38] [INFO ] Invariant cache hit.
[2023-03-19 08:02:38] [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 142 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 38 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 3083 reset in 124 ms.
Product exploration explored 100000 steps with 3188 reset in 117 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-19 08:02:39] [INFO ] Invariant cache hit.
[2023-03-19 08:02:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-19 08:02:39] [INFO ] Invariant cache hit.
[2023-03-19 08:02:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 08:02:39] [INFO ] Invariant cache hit.
[2023-03-19 08:02:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:39] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-19 08:02:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:02:39] [INFO ] Invariant cache hit.
[2023-03-19 08:02:39] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-09 finished in 2631 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)||G(p1))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-19 08:02:39] [INFO ] Invariant cache hit.
[2023-03-19 08:02:39] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-19 08:02:39] [INFO ] Invariant cache hit.
[2023-03-19 08:02:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 08:02:39] [INFO ] Invariant cache hit.
[2023-03-19 08:02:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:39] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-19 08:02:39] [INFO ] Invariant cache hit.
[2023-03-19 08:02:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-10 finished in 368 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)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-19 08:02:40] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 08:02:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-19 08:02:40] [INFO ] Invariant cache hit.
[2023-03-19 08:02:40] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 08:02:40] [INFO ] Invariant cache hit.
[2023-03-19 08:02:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:40] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 08:02:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:02:40] [INFO ] Invariant cache hit.
[2023-03-19 08:02:40] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-11 finished in 184 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||X(F((!p1 U (p2||G(!p1)))))))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-19 08:02:40] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 08:02:40] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-19 08:02:40] [INFO ] Invariant cache hit.
[2023-03-19 08:02:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 08:02:40] [INFO ] Invariant cache hit.
[2023-03-19 08:02:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:40] [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 08:02:40] [INFO ] Invariant cache hit.
[2023-03-19 08:02:40] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p2:(AND (NOT (AND (GEQ s0 1) (GEQ s8 1))) (NOT (AND (GEQ s11 65535) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1)))), p1:(AND (GEQ s11 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25014 reset in 181 ms.
Product exploration explored 100000 steps with 24965 reset in 221 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 08:02:41] [INFO ] Invariant cache hit.
[2023-03-19 08:02:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 08:02:41] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:02:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 08:02:41] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:02:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:41] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 08:02:41] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 08:02:41] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 598 ms.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-19 08:02:42] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 08:02:42] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 10/12 places, 8/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 32473 steps, run visited all 1 properties in 32 ms. (steps per millisecond=1014 )
Probabilistic random walk after 32473 steps, saw 18287 distinct states, run finished after 33 ms. (steps per millisecond=984 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-19 08:02:42] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 08:02:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-19 08:02:42] [INFO ] Invariant cache hit.
[2023-03-19 08:02:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 08:02:42] [INFO ] Invariant cache hit.
[2023-03-19 08:02:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:42] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-19 08:02:42] [INFO ] Invariant cache hit.
[2023-03-19 08:02:42] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 08:02:43] [INFO ] Invariant cache hit.
[2023-03-19 08:02:43] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-19 08:02:43] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:02:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-19 08:02:43] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:02:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:43] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 08:02:43] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 08:02:43] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 561 ms.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 3 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-19 08:02:43] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 08:02:43] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 10/12 places, 8/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 32473 steps, run visited all 1 properties in 32 ms. (steps per millisecond=1014 )
Probabilistic random walk after 32473 steps, saw 18287 distinct states, run finished after 33 ms. (steps per millisecond=984 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 25052 reset in 107 ms.
Product exploration explored 100000 steps with 24918 reset in 124 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-19 08:02:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 08:02:44] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-19 08:02:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:02:45] [INFO ] Invariant cache hit.
[2023-03-19 08:02:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 10/12 places, 9/10 transitions.
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-19 08:02:45] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-19 08:02:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-19 08:02:45] [INFO ] Invariant cache hit.
[2023-03-19 08:02:45] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 08:02:45] [INFO ] Invariant cache hit.
[2023-03-19 08:02:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:45] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-19 08:02:45] [INFO ] Invariant cache hit.
[2023-03-19 08:02:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-12 finished in 4812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0 U (G(!p0)||(!p0&&G(!p1))))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-19 08:02:45] [INFO ] Invariant cache hit.
[2023-03-19 08:02:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-19 08:02:45] [INFO ] Invariant cache hit.
[2023-03-19 08:02:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 08:02:45] [INFO ] Invariant cache hit.
[2023-03-19 08:02:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:45] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-19 08:02:45] [INFO ] Invariant cache hit.
[2023-03-19 08:02:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, p0, (AND p0 p1), p1, p0, p0, p0]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p1:(GEQ s5 65535)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 08:02:46] [INFO ] Invariant cache hit.
[2023-03-19 08:02:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 08:02:46] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 08:02:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-19 08:02:46] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 08:02:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:46] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 08:02:46] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 08:02:46] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 262172 steps, including 1 resets, run visited all 1 properties in 276 ms. (steps per millisecond=949 )
Parikh walk visited 3 properties in 2276 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 228 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-19 08:02:49] [INFO ] Invariant cache hit.
[2023-03-19 08:02:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-19 08:02:49] [INFO ] Invariant cache hit.
[2023-03-19 08:02:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 08:02:49] [INFO ] Invariant cache hit.
[2023-03-19 08:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-19 08:02:49] [INFO ] Invariant cache hit.
[2023-03-19 08:02:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 08:02:50] [INFO ] Invariant cache hit.
[2023-03-19 08:02:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 08:02:50] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 08:02:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-19 08:02:50] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 08:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:50] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 08:02:50] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-19 08:02:50] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 2819 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 4 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-19 08:02:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 08:02:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 10/12 places, 8/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 790937 steps, run visited all 1 properties in 739 ms. (steps per millisecond=1070 )
Probabilistic random walk after 790937 steps, saw 458008 distinct states, run finished after 740 ms. (steps per millisecond=1068 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 257 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 245 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 242 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 230 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-19 08:02:56] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 08:02:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-19 08:02:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:02:56] [INFO ] Invariant cache hit.
[2023-03-19 08:02:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 10/12 places, 9/10 transitions.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-19 08:02:56] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-19 08:02:56] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-19 08:02:56] [INFO ] Invariant cache hit.
[2023-03-19 08:02:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 08:02:56] [INFO ] Invariant cache hit.
[2023-03-19 08:02:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-19 08:02:56] [INFO ] Invariant cache hit.
[2023-03-19 08:02:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-14 finished in 11037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X((G(p2)&&p1))||p0))))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-19 08:02:56] [INFO ] Invariant cache hit.
[2023-03-19 08:02:56] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-19 08:02:56] [INFO ] Invariant cache hit.
[2023-03-19 08:02:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 08:02:56] [INFO ] Invariant cache hit.
[2023-03-19 08:02:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-19 08:02:56] [INFO ] Invariant cache hit.
[2023-03-19 08:02:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=6, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s8 1)) (AND (GEQ s3 61439) (GEQ s6 4096))), p2:(AND (GEQ s3 61439) (GEQ s6 4096)), p1:(AND (GEQ s0 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-15 finished in 415 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((X(X(!p0))||F(p1)))))'
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||X(F((!p1 U (p2||G(!p1)))))))))'
Found a Shortening insensitive property : SatelliteMemory-PT-X65535Y2048-LTLFireability-12
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 3 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-19 08:02:56] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-19 08:02:57] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-19 08:02:57] [INFO ] Invariant cache hit.
[2023-03-19 08:02:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 08:02:57] [INFO ] Invariant cache hit.
[2023-03-19 08:02:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 08:02:57] [INFO ] Invariant cache hit.
[2023-03-19 08:02:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 110 ms. Remains : 10/12 places, 9/10 transitions.
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s7 1)), p2:(AND (NOT (AND (GEQ s0 1) (GEQ s6 1))) (NOT (AND (GEQ s9 65535) (GEQ s3 1) (GEQ s5 1) (GEQ s6 1)))), p1:(AND (GEQ s9 65...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24942 reset in 320 ms.
Product exploration explored 100000 steps with 25060 reset in 386 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 08:02:58] [INFO ] Invariant cache hit.
[2023-03-19 08:02:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-19 08:02:58] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:02:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-19 08:02:58] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:02:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:58] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 08:02:58] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-19 08:02:58] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8308 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=692 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-19 08:02:58] [INFO ] Invariant cache hit.
[2023-03-19 08:02:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-19 08:02:58] [INFO ] Invariant cache hit.
[2023-03-19 08:02:58] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 08:02:58] [INFO ] Invariant cache hit.
[2023-03-19 08:02:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:58] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-19 08:02:58] [INFO ] Invariant cache hit.
[2023-03-19 08:02:58] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 10/10 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 08:02:59] [INFO ] Invariant cache hit.
[2023-03-19 08:02:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-19 08:02:59] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:02:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-19 08:02:59] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:02:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:02:59] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 08:02:59] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-19 08:02:59] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 270870 steps, including 0 resets, run visited all 1 properties in 276 ms. (steps per millisecond=981 )
Parikh walk visited 1 properties in 276 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 25085 reset in 99 ms.
Product exploration explored 100000 steps with 24963 reset in 115 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-19 08:03:00] [INFO ] Invariant cache hit.
[2023-03-19 08:03:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-19 08:03:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 08:03:00] [INFO ] Invariant cache hit.
[2023-03-19 08:03:00] [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 59 ms. Remains : 10/10 places, 9/9 transitions.
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-19 08:03:00] [INFO ] Invariant cache hit.
[2023-03-19 08:03:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-19 08:03:00] [INFO ] Invariant cache hit.
[2023-03-19 08:03:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 08:03:00] [INFO ] Invariant cache hit.
[2023-03-19 08:03:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:03:00] [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 08:03:00] [INFO ] Invariant cache hit.
[2023-03-19 08:03:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-12 finished in 3973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0 U (G(!p0)||(!p0&&G(!p1))))))))'
[2023-03-19 08:03:00] [INFO ] Flatten gal took : 10 ms
[2023-03-19 08:03:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 08:03:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 38 arcs took 1 ms.
Total runtime 36172 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1829/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1829/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1829/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SatelliteMemory-PT-X65535Y2048-LTLFireability-09
Could not compute solution for formula : SatelliteMemory-PT-X65535Y2048-LTLFireability-12
Could not compute solution for formula : SatelliteMemory-PT-X65535Y2048-LTLFireability-14

BK_STOP 1679212982093

--------------------
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 SatelliteMemory-PT-X65535Y2048-LTLFireability-09
ltl formula formula --ltl=/tmp/1829/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 12 places, 10 transitions and 38 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1829/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1829/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1829/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1829/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55bafe3463f4]
1: pnml2lts-mc(+0xa2496) [0x55bafe346496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f5fc627a140]
3: /lib/x86_64-linux-gnu/libc.so.6(+0x84038) [0x7f5fc6116038]
4: pnml2lts-mc(+0x16b416) [0x55bafe40f416]
5: pnml2lts-mc(+0x164ac4) [0x55bafe408ac4]
6: pnml2lts-mc(+0x272e0a) [0x55bafe516e0a]
7: pnml2lts-mc(+0xb61f0) [0x55bafe35a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f5fc60cd4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f5fc60cd67a]
10: pnml2lts-mc(+0xa1581) [0x55bafe345581]
11: pnml2lts-mc(+0xa1910) [0x55bafe345910]
12: pnml2lts-mc(+0xa32a2) [0x55bafe3472a2]
13: pnml2lts-mc(+0xa50f4) [0x55bafe3490f4]
14: pnml2lts-mc(+0xa516b) [0x55bafe34916b]
15: pnml2lts-mc(+0x3f34b3) [0x55bafe6974b3]
16: pnml2lts-mc(+0x7c63d) [0x55bafe32063d]
17: pnml2lts-mc(+0x67d86) [0x55bafe30bd86]
18: pnml2lts-mc(+0x60a8a) [0x55bafe304a8a]
19: pnml2lts-mc(+0x5eb15) [0x55bafe302b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f5fc60b5d0a]
21: pnml2lts-mc(+0x6075e) [0x55bafe30475e]
ltl formula name SatelliteMemory-PT-X65535Y2048-LTLFireability-12
ltl formula formula --ltl=/tmp/1829/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 12 places, 10 transitions and 38 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1829/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1829/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1829/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1829/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name SatelliteMemory-PT-X65535Y2048-LTLFireability-14
ltl formula formula --ltl=/tmp/1829/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 12 places, 10 transitions and 38 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1829/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1829/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1829/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1829/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="SatelliteMemory-PT-X65535Y2048"
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 SatelliteMemory-PT-X65535Y2048, 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 r361-smll-167891811300332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SatelliteMemory-PT-X65535Y2048.tgz
mv SatelliteMemory-PT-X65535Y2048 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 ;