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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.7K Feb 26 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 12:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 12:43 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.8K 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.2K Feb 25 16:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 26 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 12:51 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-X01500Y0046-LTLCardinality-00
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-01
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-02
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-03
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-04
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-05
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-06
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-07
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-08
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-09
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-10
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-11
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-12
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-13
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-14
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679070810450

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SatelliteMemory-PT-X01500Y0046
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 16:33:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 16:33:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 16:33:32] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-17 16:33:32] [INFO ] Transformed 13 places.
[2023-03-17 16:33:32] [INFO ] Transformed 10 transitions.
[2023-03-17 16:33:32] [INFO ] Parsed PT model containing 13 places and 10 transitions and 40 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 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 12 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-17 16:33:33] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-17 16:33:33] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
[2023-03-17 16:33:33] [INFO ] Invariant cache hit.
[2023-03-17 16:33:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 16:33:33] [INFO ] Invariant cache hit.
[2023-03-17 16:33:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:33] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-17 16:33:33] [INFO ] Invariant cache hit.
[2023-03-17 16:33:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-17 16:33:33] [INFO ] Flatten gal took : 23 ms
[2023-03-17 16:33:33] [INFO ] Flatten gal took : 9 ms
[2023-03-17 16:33:33] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 712 ms. (steps per millisecond=14 ) properties (out of 27) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-17 16:33:35] [INFO ] Invariant cache hit.
[2023-03-17 16:33:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-17 16:33:35] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-17 16:33:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-17 16:33:35] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-17 16:33:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:35] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-03-17 16:33:35] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 5 ms to minimize.
[2023-03-17 16:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-17 16:33:35] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-17 16:33:35] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Finished Parikh walk after 14818 steps, including 0 resets, run visited all 1 properties in 62 ms. (steps per millisecond=239 )
Parikh walk visited 5 properties in 224 ms.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-10 FALSE 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(X(X(F(p0)))))'
Support contains 1 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-17 16:33:36] [INFO ] Invariant cache hit.
[2023-03-17 16:33:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-17 16:33:36] [INFO ] Invariant cache hit.
[2023-03-17 16:33:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-17 16:33:36] [INFO ] Invariant cache hit.
[2023-03-17 16:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:36] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-17 16:33:36] [INFO ] Invariant cache hit.
[2023-03-17 16:33:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 3 s8)], 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 25000 reset in 325 ms.
Product exploration explored 100000 steps with 25000 reset in 206 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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
Interrupted probabilistic random walk after 3147765 steps, run timeout after 3001 ms. (steps per millisecond=1048 ) properties seen :{}
Probabilistic random walk after 3147765 steps, saw 1096183 distinct states, run finished after 3002 ms. (steps per millisecond=1048 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:33:40] [INFO ] Invariant cache hit.
[2023-03-17 16:33:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-17 16:33:40] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:33:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-17 16:33:40] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:33:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:40] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:33:40] [INFO ] After 15ms 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-17 16:33:40] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2812 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=401 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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-17 16:33:41] [INFO ] Invariant cache hit.
[2023-03-17 16:33:41] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-17 16:33:41] [INFO ] Invariant cache hit.
[2023-03-17 16:33:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-17 16:33:41] [INFO ] Invariant cache hit.
[2023-03-17 16:33:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:41] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-17 16:33:41] [INFO ] Invariant cache hit.
[2023-03-17 16:33:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3115343 steps, run timeout after 3001 ms. (steps per millisecond=1038 ) properties seen :{}
Probabilistic random walk after 3115343 steps, saw 1081477 distinct states, run finished after 3001 ms. (steps per millisecond=1038 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:33:44] [INFO ] Invariant cache hit.
[2023-03-17 16:33:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-17 16:33:44] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:33:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-17 16:33:44] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:33:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:44] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:33:44] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 16:33:44] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2812 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=468 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 157 ms.
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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 7 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 23 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-17 16:33:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 16:33:46] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-17 16:33:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:46] [INFO ] Dead Transitions using invariants and state equation in 42 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 117 ms. Remains : 10/12 places, 9/10 transitions.
Support contains 1 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-17 16:33:46] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 16:33:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:46] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:46] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:46] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-00 finished in 10458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 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-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:46] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-01 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 (LEQ 3 s5) (LEQ s9 s5))], 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 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 100 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-01 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 5 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-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-17 16:33:46] [INFO ] Invariant cache hit.
[2023-03-17 16:33:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 16:33:47] [INFO ] Invariant cache hit.
[2023-03-17 16:33:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-17 16:33:47] [INFO ] Invariant cache hit.
[2023-03-17 16:33:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ s1 s7) (LEQ s9 s6)), p1:(AND (LEQ s9 s6) (LEQ s5 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 193 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-02 finished in 788 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)))&&(F(p1) U (X(p2) U p1))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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-17 16:33:47] [INFO ] Invariant cache hit.
[2023-03-17 16:33:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-17 16:33:47] [INFO ] Invariant cache hit.
[2023-03-17 16:33:47] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 16:33:47] [INFO ] Invariant cache hit.
[2023-03-17 16:33:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:48] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s1 s11), p0:(LEQ s7 s0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-03 finished in 582 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 1 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-17 16:33:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 16:33:48] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:48] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-17 16:33:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] Dead Transitions using invariants and state equation in 35 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 135 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], 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-X01500Y0046-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-04 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 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.
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:48] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-17 16:33:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [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 137 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s9 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 308 steps with 0 reset in 3 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-05 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 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.
// Phase 1: matrix 10 rows 12 cols
[2023-03-17 16:33:48] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 16:33:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:48] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-17 16:33:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 16:33:48] [INFO ] Invariant cache hit.
[2023-03-17 16:33:48] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 181 ms.
Stack based approach found an accepted trace after 42 steps with 6 reset with depth 12 and stack size 12 in 1 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-06 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||(p1 U (p2||G(p1)))) U (G((X(p0)||(p1 U (p2||G(p1)))))||(p0&&(X(p0)||(p1 U (p2||G(p1))))))))'
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-17 16:33:49] [INFO ] Invariant cache hit.
[2023-03-17 16:33:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 16:33:49] [INFO ] Invariant cache hit.
[2023-03-17 16:33:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 16:33:49] [INFO ] Invariant cache hit.
[2023-03-17 16:33:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-17 16:33:49] [INFO ] Invariant cache hit.
[2023-03-17 16:33:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s11 s10), p2:(AND (GT 2 s2) (LEQ s10 s0)), p1:(LEQ s10 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 10 factoid took 282 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-09 finished in 1031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F((!p1 U (p2||G(!p1)))))))))'
Support contains 4 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-17 16:33:50] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-17 16:33:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-17 16:33:50] [INFO ] Invariant cache hit.
[2023-03-17 16:33:50] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-17 16:33:50] [INFO ] Invariant cache hit.
[2023-03-17 16:33:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:50] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-17 16:33:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 16:33:50] [INFO ] Invariant cache hit.
[2023-03-17 16:33:50] [INFO ] Dead Transitions using invariants and state equation in 40 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 152 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p2) p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GT 1 s0) (GT 1 s4)), p1:(LEQ 1 s0), p0:(GT s9 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 298 steps with 0 reset in 2 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-11 finished in 345 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))&&(F(p1)||X(G(p2))))))'
Support contains 5 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-17 16:33:50] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 16:33:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 16:33:50] [INFO ] Invariant cache hit.
[2023-03-17 16:33:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-17 16:33:50] [INFO ] Invariant cache hit.
[2023-03-17 16:33:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:50] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-17 16:33:50] [INFO ] Invariant cache hit.
[2023-03-17 16:33:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 1 s8), p2:(LEQ s1 s11), p0:(LEQ s10 s0)], 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-12 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' '!(X(G((p0||X(G(p1))))))'
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-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:51] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GT 2 s3) (GT 1 s1)), p0:(GT s4 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-13 finished in 324 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 2 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-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:51] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-17 16:33:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [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 141 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-14 finished in 378 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(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-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:51] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-17 16:33:51] [INFO ] Invariant cache hit.
[2023-03-17 16:33:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s3), p1:(GT s11 s8)], 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 4468 reset in 123 ms.
Product exploration explored 100000 steps with 4463 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 317 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:33:52] [INFO ] Invariant cache hit.
[2023-03-17 16:33:52] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-17 16:33:52] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:33:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-17 16:33:52] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:33:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:52] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:33:52] [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 6 ms.
[2023-03-17 16:33:52] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 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 1 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-17 16:33:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 16:33:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 10/12 places, 8/10 transitions.
Finished random walk after 1070 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=535 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 446 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT 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.
// Phase 1: matrix 10 rows 12 cols
[2023-03-17 16:33:53] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 16:33:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-17 16:33:53] [INFO ] Invariant cache hit.
[2023-03-17 16:33:53] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-17 16:33:53] [INFO ] Invariant cache hit.
[2023-03-17 16:33:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:53] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-17 16:33:53] [INFO ] Invariant cache hit.
[2023-03-17 16:33:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 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) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 288 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 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-17 16:33:54] [INFO ] Invariant cache hit.
[2023-03-17 16:33:54] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-17 16:33:54] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:33:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-17 16:33:54] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:33:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:54] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:33:54] [INFO ] After 23ms 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-17 16:33:54] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 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-17 16:33:54] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-17 16:33:54] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 10/12 places, 8/10 transitions.
Finished random walk after 222 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=222 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 393 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4555 reset in 192 ms.
Product exploration explored 100000 steps with 4428 reset in 227 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT 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.
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-17 16:33:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 16:33:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-17 16:33:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 16:33:55] [INFO ] Invariant cache hit.
[2023-03-17 16:33:55] [INFO ] Dead Transitions using invariants and state equation in 36 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 75 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 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-17 16:33:55] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 16:33:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-17 16:33:55] [INFO ] Invariant cache hit.
[2023-03-17 16:33:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-17 16:33:55] [INFO ] Invariant cache hit.
[2023-03-17 16:33:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:56] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-17 16:33:56] [INFO ] Invariant cache hit.
[2023-03-17 16:33:56] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-15 finished in 4359 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(F(p0)))))'
Found a Shortening insensitive property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-00
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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 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-17 16:33:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-17 16:33:56] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-17 16:33:56] [INFO ] Invariant cache hit.
[2023-03-17 16:33:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-17 16:33:56] [INFO ] Invariant cache hit.
[2023-03-17 16:33:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:33:56] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-17 16:33:56] [INFO ] Invariant cache hit.
[2023-03-17 16:33:56] [INFO ] Dead Transitions using invariants and state equation in 30 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 144 ms. Remains : 10/12 places, 9/10 transitions.
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 57 ms.
Product exploration explored 100000 steps with 25000 reset in 69 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3316639 steps, run timeout after 3001 ms. (steps per millisecond=1105 ) properties seen :{}
Probabilistic random walk after 3316639 steps, saw 1048943 distinct states, run finished after 3001 ms. (steps per millisecond=1105 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:33:59] [INFO ] Invariant cache hit.
[2023-03-17 16:34:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-17 16:34:00] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:34:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-17 16:34:00] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:34:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:34:00] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:34:00] [INFO ] After 17ms 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-17 16:34:00] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2812 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=562 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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-17 16:34:00] [INFO ] Invariant cache hit.
[2023-03-17 16:34:00] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-17 16:34:00] [INFO ] Invariant cache hit.
[2023-03-17 16:34:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 16:34:00] [INFO ] Invariant cache hit.
[2023-03-17 16:34:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:34:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-17 16:34:00] [INFO ] Invariant cache hit.
[2023-03-17 16:34:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 10/10 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3727031 steps, run timeout after 3001 ms. (steps per millisecond=1241 ) properties seen :{}
Probabilistic random walk after 3727031 steps, saw 1202813 distinct states, run finished after 3006 ms. (steps per millisecond=1239 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:34:04] [INFO ] Invariant cache hit.
[2023-03-17 16:34:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-17 16:34:04] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:34:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-17 16:34:04] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:34:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:34:04] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 16:34:04] [INFO ] After 17ms 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-17 16:34:04] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2812 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=703 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 57 ms.
Product exploration explored 100000 steps with 25000 reset in 68 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-17 16:34:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 10/10 places, 9/9 transitions.
Support contains 1 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 0 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:34:05] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-00 finished in 9400 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(G(p1))))'
Found a Lengthening insensitive property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-15
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 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 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.
[2023-03-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:34:05] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-17 16:34:05] [INFO ] Invariant cache hit.
[2023-03-17 16:34:05] [INFO ] Dead Transitions using invariants and state equation in 26 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 114 ms. Remains : 10/12 places, 9/10 transitions.
Running random walk in product with property : SatelliteMemory-PT-X01500Y0046-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s2), p1:(GT s9 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2690 reset in 452 ms.
Product exploration explored 100000 steps with 2789 reset in 267 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 188 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 411 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 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-17 16:34:07] [INFO ] Invariant cache hit.
[2023-03-17 16:34:07] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-17 16:34:07] [INFO ] Invariant cache hit.
[2023-03-17 16:34:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 16:34:07] [INFO ] Invariant cache hit.
[2023-03-17 16:34:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:34:07] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-17 16:34:07] [INFO ] Invariant cache hit.
[2023-03-17 16:34:07] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 10/10 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8236 steps, including 2 resets, run visited all 3 properties in 17 ms. (steps per millisecond=484 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 381 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2728 reset in 120 ms.
Product exploration explored 100000 steps with 2711 reset in 138 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 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 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-17 16:34:09] [INFO ] Invariant cache hit.
[2023-03-17 16:34:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-17 16:34:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 16:34:09] [INFO ] Invariant cache hit.
[2023-03-17 16:34:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 10/10 places, 9/9 transitions.
Support contains 3 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-17 16:34:09] [INFO ] Invariant cache hit.
[2023-03-17 16:34:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-03-17 16:34:09] [INFO ] Invariant cache hit.
[2023-03-17 16:34:09] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 16:34:09] [INFO ] Invariant cache hit.
[2023-03-17 16:34:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 16:34:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-17 16:34:09] [INFO ] Invariant cache hit.
[2023-03-17 16:34:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property SatelliteMemory-PT-X01500Y0046-LTLCardinality-15 finished in 4550 ms.
[2023-03-17 16:34:10] [INFO ] Flatten gal took : 4 ms
[2023-03-17 16:34:10] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-17 16:34:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 38 arcs took 0 ms.
Total runtime 37244 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SatelliteMemory-PT-X01500Y0046
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLCardinality

FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-LTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679070851040

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 SatelliteMemory-PT-X01500Y0046-LTLCardinality-15
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for SatelliteMemory-PT-X01500Y0046-LTLCardinality-15
lola: result : false
lola: markings : 375
lola: fired transitions : 514
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 SatelliteMemory-PT-X01500Y0046-LTLCardinality-00
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SatelliteMemory-PT-X01500Y0046-LTLCardinality-00
lola: result : true
lola: markings : 10
lola: fired transitions : 12
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SatelliteMemory-PT-X01500Y0046-LTLCardinality-00: LTL true LTL model checker
SatelliteMemory-PT-X01500Y0046-LTLCardinality-15: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is SatelliteMemory-PT-X01500Y0046, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r359-smll-167891808800315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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