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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 12 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 5.5K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-00
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-01
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-02
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-03
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-04
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-05
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-06
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-07
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-08
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-09
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-10
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-11
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-12
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-13
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-14
FORMULA_NAME SatelliteMemory-PT-X65535Y2048-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679124048453

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SatelliteMemory-PT-X65535Y2048
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 07:20:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 07:20:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 07:20:52] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-18 07:20:52] [INFO ] Transformed 13 places.
[2023-03-18 07:20:52] [INFO ] Transformed 10 transitions.
[2023-03-18 07:20:52] [INFO ] Parsed PT model containing 13 places and 10 transitions and 40 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 18 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 07:20:52] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-18 07:20:52] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
[2023-03-18 07:20:52] [INFO ] Invariant cache hit.
[2023-03-18 07:20:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 07:20:52] [INFO ] Invariant cache hit.
[2023-03-18 07:20:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:20:52] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-18 07:20:52] [INFO ] Invariant cache hit.
[2023-03-18 07:20:52] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 10 out of 12 places after structural reductions.
[2023-03-18 07:20:52] [INFO ] Flatten gal took : 23 ms
[2023-03-18 07:20:52] [INFO ] Flatten gal took : 5 ms
[2023-03-18 07:20:52] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=13 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 07:20:54] [INFO ] Invariant cache hit.
[2023-03-18 07:20:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 07:20:54] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-18 07:20:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-18 07:20:54] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-18 07:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:20:54] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-18 07:20:54] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 07:20:54] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 5823 ms.
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 3 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 12 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-18 07:21:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 07:21:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 10/12 places, 8/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Finished probabilistic random walk after 790934 steps, run visited all 2 properties in 1041 ms. (steps per millisecond=759 )
Probabilistic random walk after 790934 steps, saw 458006 distinct states, run finished after 1041 ms. (steps per millisecond=759 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 07:21:02] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 07:21:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-18 07:21:02] [INFO ] Invariant cache hit.
[2023-03-18 07:21:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 07:21:02] [INFO ] Invariant cache hit.
[2023-03-18 07:21:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:02] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-18 07:21:02] [INFO ] Invariant cache hit.
[2023-03-18 07:21:02] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s8 1)) (AND (GEQ s3 1) (GEQ s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 33398 reset in 357 ms.
Stack based approach found an accepted trace after 46 steps with 18 reset with depth 3 and stack size 3 in 1 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-00 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&(G(p1)||G(F(!p1)))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 07:21:02] [INFO ] Invariant cache hit.
[2023-03-18 07:21:02] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-18 07:21:02] [INFO ] Invariant cache hit.
[2023-03-18 07:21:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 07:21:02] [INFO ] Invariant cache hit.
[2023-03-18 07:21:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:03] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-18 07:21:03] [INFO ] Invariant cache hit.
[2023-03-18 07:21:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 396 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, false, p1]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s5 65535), p1:(AND (GEQ s3 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-01 finished in 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(p0)||X(X(G(p1)))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 07:21:03] [INFO ] Invariant cache hit.
[2023-03-18 07:21:03] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-18 07:21:03] [INFO ] Invariant cache hit.
[2023-03-18 07:21:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 07:21:03] [INFO ] Invariant cache hit.
[2023-03-18 07:21:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:03] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-18 07:21:03] [INFO ] Invariant cache hit.
[2023-03-18 07:21:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s8 1) (GEQ s2 1)), p1:(OR (LT s0 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23306 reset in 261 ms.
Stack based approach found an accepted trace after 18 steps with 3 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-02 finished in 648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 5 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 07:21:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 07:21:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-18 07:21:04] [INFO ] Invariant cache hit.
[2023-03-18 07:21:04] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 07:21:04] [INFO ] Invariant cache hit.
[2023-03-18 07:21:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:04] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-18 07:21:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 07:21:04] [INFO ] Invariant cache hit.
[2023-03-18 07:21:04] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 61439) (GEQ s4 61439))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-03 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)&&p0))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 07:21:04] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 07:21:04] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-18 07:21:04] [INFO ] Invariant cache hit.
[2023-03-18 07:21:04] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 07:21:04] [INFO ] Invariant cache hit.
[2023-03-18 07:21:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:04] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-18 07:21:04] [INFO ] Invariant cache hit.
[2023-03-18 07:21:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s3 61439) (GEQ s5 61439)), p0:(AND (GEQ s0 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 206 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-05 finished in 534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(!p0))||F(p1)))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 07:21:04] [INFO ] Invariant cache hit.
[2023-03-18 07:21:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-18 07:21:04] [INFO ] Invariant cache hit.
[2023-03-18 07:21:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 07:21:04] [INFO ] Invariant cache hit.
[2023-03-18 07:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:05] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-18 07:21:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 07:21:05] [INFO ] Invariant cache hit.
[2023-03-18 07:21:05] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3173 reset in 106 ms.
Product exploration explored 100000 steps with 3111 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 360 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 07:21:06] [INFO ] Invariant cache hit.
[2023-03-18 07:21:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2023-03-18 07:21:06] [INFO ] Invariant cache hit.
[2023-03-18 07:21:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-18 07:21:06] [INFO ] Invariant cache hit.
[2023-03-18 07:21:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:06] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-18 07:21:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 07:21:06] [INFO ] Invariant cache hit.
[2023-03-18 07:21:06] [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 175 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 407 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 3154 reset in 102 ms.
Product exploration explored 100000 steps with 3163 reset in 125 ms.
Built C files in :
/tmp/ltsmin16486513918235626355
[2023-03-18 07:21:07] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2023-03-18 07:21:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 07:21:07] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2023-03-18 07:21:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 07:21:07] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2023-03-18 07:21:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 07:21:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16486513918235626355
Running compilation step : cd /tmp/ltsmin16486513918235626355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 240 ms.
Running link step : cd /tmp/ltsmin16486513918235626355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin16486513918235626355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11655910686922063874.hoa' '--buchi-type=spotba'
LTSmin run took 5478 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-09 finished in 8854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 07:21:13] [INFO ] Invariant cache hit.
[2023-03-18 07:21:13] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-18 07:21:13] [INFO ] Invariant cache hit.
[2023-03-18 07:21:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 07:21:13] [INFO ] Invariant cache hit.
[2023-03-18 07:21:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-18 07:21:13] [INFO ] Invariant cache hit.
[2023-03-18 07:21:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-10 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 07:21:14] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 07:21:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-18 07:21:14] [INFO ] Invariant cache hit.
[2023-03-18 07:21:14] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 07:21:14] [INFO ] Invariant cache hit.
[2023-03-18 07:21:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:14] [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-18 07:21:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 07:21:14] [INFO ] Invariant cache hit.
[2023-03-18 07:21:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-11 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F((!p1 U (p2||G(!p1)))))))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 07:21:14] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 07:21:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-18 07:21:14] [INFO ] Invariant cache hit.
[2023-03-18 07:21:14] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 07:21:14] [INFO ] Invariant cache hit.
[2023-03-18 07:21:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:14] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-18 07:21:14] [INFO ] Invariant cache hit.
[2023-03-18 07:21:14] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p2:(AND (NOT (AND (GEQ s0 1) (GEQ s8 1))) (NOT (AND (GEQ s11 65535) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1)))), p1:(AND (GEQ s11 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25008 reset in 174 ms.
Product exploration explored 100000 steps with 25008 reset in 213 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
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-18 07:21:15] [INFO ] Invariant cache hit.
[2023-03-18 07:21:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 07:21:15] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:21:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 07:21:15] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:21:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:15] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 07:21:15] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 07:21:15] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 571 ms.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-18 07:21:16] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-18 07:21:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 10/12 places, 8/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 32473 steps, run visited all 1 properties in 34 ms. (steps per millisecond=955 )
Probabilistic random walk after 32473 steps, saw 18287 distinct states, run finished after 35 ms. (steps per millisecond=927 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 293 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 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-18 07:21:16] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 07:21:16] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-18 07:21:16] [INFO ] Invariant cache hit.
[2023-03-18 07:21:16] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 07:21:16] [INFO ] Invariant cache hit.
[2023-03-18 07:21:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:16] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-18 07:21:16] [INFO ] Invariant cache hit.
[2023-03-18 07:21:16] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 07:21:17] [INFO ] Invariant cache hit.
[2023-03-18 07:21:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-18 07:21:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:21:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 07:21:17] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:21:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:17] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 07:21:17] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 07:21:17] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 837 ms.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-18 07:21:18] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 07:21:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 10/12 places, 8/10 transitions.
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 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 32473 steps, run visited all 1 properties in 34 ms. (steps per millisecond=955 )
Probabilistic random walk after 32473 steps, saw 18287 distinct states, run finished after 35 ms. (steps per millisecond=927 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 24964 reset in 126 ms.
Product exploration explored 100000 steps with 25007 reset in 126 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Applied a total of 1 rules in 3 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 07:21:19] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 07:21:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-18 07:21:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 07:21:19] [INFO ] Invariant cache hit.
[2023-03-18 07:21:19] [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 100 ms. Remains : 10/12 places, 9/10 transitions.
Built C files in :
/tmp/ltsmin12882353611789721974
[2023-03-18 07:21:19] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12882353611789721974
Running compilation step : cd /tmp/ltsmin12882353611789721974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 152 ms.
Running link step : cd /tmp/ltsmin12882353611789721974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12882353611789721974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9398514967744505724.hoa' '--buchi-type=spotba'
LTSmin run took 52 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-12 finished in 5715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0 U (G(!p0)||(!p0&&G(!p1))))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 07:21:20] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 07:21:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-18 07:21:20] [INFO ] Invariant cache hit.
[2023-03-18 07:21:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 07:21:20] [INFO ] Invariant cache hit.
[2023-03-18 07:21:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-18 07:21:20] [INFO ] Invariant cache hit.
[2023-03-18 07:21:20] [INFO ] Dead Transitions using invariants and state equation in 39 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 315 ms :[true, p0, (AND p0 p1), p1, p0, p0, p0]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1)), p1:(GEQ s5 65535)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 07:21:21] [INFO ] Invariant cache hit.
[2023-03-18 07:21:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 07:21:21] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 07:21:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 07:21:21] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 07:21:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:21] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 07:21:21] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-18 07:21:21] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 2768 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 3 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-18 07:21:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 07:21:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 10/12 places, 8/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 790937 steps, run visited all 1 properties in 1166 ms. (steps per millisecond=678 )
Probabilistic random walk after 790937 steps, saw 458008 distinct states, run finished after 1169 ms. (steps per millisecond=676 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 335 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 302 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 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-18 07:21:26] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 07:21:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-18 07:21:27] [INFO ] Invariant cache hit.
[2023-03-18 07:21:27] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 07:21:27] [INFO ] Invariant cache hit.
[2023-03-18 07:21:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-18 07:21:27] [INFO ] Invariant cache hit.
[2023-03-18 07:21:27] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 07:21:27] [INFO ] Invariant cache hit.
[2023-03-18 07:21:27] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-18 07:21:28] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 07:21:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 07:21:28] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 07:21:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:28] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 07:21:28] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-18 07:21:28] [INFO ] After 448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 2759 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 2 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-18 07:21:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 07:21:31] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 10/12 places, 8/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 790937 steps, run visited all 1 properties in 993 ms. (steps per millisecond=796 )
Probabilistic random walk after 790937 steps, saw 458008 distinct states, run finished after 993 ms. (steps per millisecond=796 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 387 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 438 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 290 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 181 ms.
Product exploration explored 100000 steps with 0 reset in 223 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 250 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (trivial) has 2 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 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-18 07:21:34] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 07:21:34] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-18 07:21:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 07:21:34] [INFO ] Invariant cache hit.
[2023-03-18 07:21:34] [INFO ] Dead Transitions using invariants and state equation in 31 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 67 ms. Remains : 10/12 places, 9/10 transitions.
Built C files in :
/tmp/ltsmin6771061930838081600
[2023-03-18 07:21:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6771061930838081600
Running compilation step : cd /tmp/ltsmin6771061930838081600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin6771061930838081600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6771061930838081600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5636771496799845323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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-18 07:21:49] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 07:21:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-18 07:21:49] [INFO ] Invariant cache hit.
[2023-03-18 07:21:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 07:21:49] [INFO ] Invariant cache hit.
[2023-03-18 07:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:21:49] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-18 07:21:49] [INFO ] Invariant cache hit.
[2023-03-18 07:21:49] [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.
Built C files in :
/tmp/ltsmin8691804901729534860
[2023-03-18 07:21:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8691804901729534860
Running compilation step : cd /tmp/ltsmin8691804901729534860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin8691804901729534860;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8691804901729534860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1861727602408550551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 07:22:05] [INFO ] Flatten gal took : 3 ms
[2023-03-18 07:22:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 07:22:05] [INFO ] Time to serialize gal into /tmp/LTL1962278166683326447.gal : 2 ms
[2023-03-18 07:22:05] [INFO ] Time to serialize properties into /tmp/LTL16732500366162884286.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1962278166683326447.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7154007563060788002.hoa' '-atoms' '/tmp/LTL16732500366162884286.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16732500366162884286.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7154007563060788002.hoa
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-18 07:22:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 07:22:05] [INFO ] Flatten gal took : 2 ms
[2023-03-18 07:22:05] [INFO ] Time to serialize gal into /tmp/LTL5329087423777725942.gal : 1 ms
[2023-03-18 07:22:05] [INFO ] Time to serialize properties into /tmp/LTL13179489798654312282.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5329087423777725942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13179489798654312282.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((!("((p12>=1)&&(p7>=1))"))U((G(!("((p12>=1)&&(p7>=1))")))||((!("((p12>=1)&&(p7>=1))"))&&(G("(p3<65535)")))))))))
Formula 0 simplified : XXX(F!"(p3<65535)" U "((p12>=1)&&(p7>=1))")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-18 07:22:05] [INFO ] Flatten gal took : 3 ms
[2023-03-18 07:22:05] [INFO ] Applying decomposition
[2023-03-18 07:22:05] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph622625107405373856.txt' '-o' '/tmp/graph622625107405373856.bin' '-w' '/tmp/graph622625107405373856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph622625107405373856.bin' '-l' '-1' '-v' '-w' '/tmp/graph622625107405373856.weights' '-q' '0' '-e' '0.001'
[2023-03-18 07:22:05] [INFO ] Decomposing Gal with order
[2023-03-18 07:22:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 07:22:05] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-18 07:22:05] [INFO ] Flatten gal took : 36 ms
[2023-03-18 07:22:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2023-03-18 07:22:05] [INFO ] Time to serialize gal into /tmp/LTL13357037605718214741.gal : 1 ms
[2023-03-18 07:22:05] [INFO ] Time to serialize properties into /tmp/LTL16369764151808187365.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13357037605718214741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16369764151808187365.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X((!("((i0.u2.p12>=1)&&(i2.u5.p7>=1))"))U((G(!("((i0.u2.p12>=1)&&(i2.u5.p7>=1))")))||((!("((i0.u2.p12>=1)&&(i2.u5.p7>=1))"))&&(...184
Formula 0 simplified : XXX(F!"(i0.u3.p3<65535)" U "((i0.u2.p12>=1)&&(i2.u5.p7>=1))")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin5235174979437449140
[2023-03-18 07:22:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5235174979437449140
Running compilation step : cd /tmp/ltsmin5235174979437449140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 145 ms.
Running link step : cd /tmp/ltsmin5235174979437449140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5235174979437449140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-14 finished in 60393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X((G(p2)&&p1))||p0))))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-18 07:22:20] [INFO ] Invariant cache hit.
[2023-03-18 07:22:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-18 07:22:20] [INFO ] Invariant cache hit.
[2023-03-18 07:22:20] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 07:22:20] [INFO ] Invariant cache hit.
[2023-03-18 07:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 07:22:20] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-18 07:22:20] [INFO ] Invariant cache hit.
[2023-03-18 07:22:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 334 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SatelliteMemory-PT-X65535Y2048-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=6, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s8 1)) (AND (GEQ s3 61439) (GEQ s6 4096))), p2:(AND (GEQ s3 61439) (GEQ s6 4096)), p1:(AND (GEQ s0 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA SatelliteMemory-PT-X65535Y2048-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SatelliteMemory-PT-X65535Y2048-LTLFireability-15 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0 U (G(!p0)||(!p0&&G(!p1))))))))'
[2023-03-18 07:22:21] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8286949493800187833
[2023-03-18 07:22:21] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2023-03-18 07:22:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 07:22:21] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2023-03-18 07:22:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 07:22:21] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2023-03-18 07:22:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 07:22:21] [INFO ] Applying decomposition
[2023-03-18 07:22:21] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8286949493800187833
Running compilation step : cd /tmp/ltsmin8286949493800187833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 07:22:21] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9796888504443101363.txt' '-o' '/tmp/graph9796888504443101363.bin' '-w' '/tmp/graph9796888504443101363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9796888504443101363.bin' '-l' '-1' '-v' '-w' '/tmp/graph9796888504443101363.weights' '-q' '0' '-e' '0.001'
[2023-03-18 07:22:21] [INFO ] Decomposing Gal with order
[2023-03-18 07:22:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 07:22:21] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-18 07:22:21] [INFO ] Flatten gal took : 6 ms
[2023-03-18 07:22:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2023-03-18 07:22:21] [INFO ] Time to serialize gal into /tmp/LTLFireability15401851263782854925.gal : 1 ms
[2023-03-18 07:22:21] [INFO ] Time to serialize properties into /tmp/LTLFireability12419536701580763880.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15401851263782854925.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12419536701580763880.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X(X((!("((i2.u4.p12>=1)&&(i0.u5.p7>=1))"))U((G(!("((i2.u4.p12>=1)&&(i0.u5.p7>=1))")))||((!("((i2.u4.p12>=1)&&(i0.u5.p7>=1))"))&&(...184
Formula 0 simplified : XXX(F!"(i2.u2.p3<65535)" U "((i2.u4.p12>=1)&&(i0.u5.p7>=1))")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-18 07:22:21] [INFO ] Flatten gal took : 3 ms
[2023-03-18 07:22:21] [INFO ] Time to serialize gal into /tmp/LTLFireability10192541103984795050.gal : 1 ms
[2023-03-18 07:22:21] [INFO ] Time to serialize properties into /tmp/LTLFireability5688715355317433053.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10192541103984795050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5688715355317433053.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(X((!("((p12>=1)&&(p7>=1))"))U((G(!("((p12>=1)&&(p7>=1))")))||((!("((p12>=1)&&(p7>=1))"))&&(G("(p3<65535)")))))))))
Formula 0 simplified : XXX(F!"(p3<65535)" U "((p12>=1)&&(p7>=1))")
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin8286949493800187833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
ITS-tools command line returned an error code 134
terminate called after throwing an instance of 'char const*'
[2023-03-18 07:22:21] [INFO ] Flatten gal took : 4 ms
[2023-03-18 07:22:21] [INFO ] Input system was already deterministic with 10 transitions.
[2023-03-18 07:22:21] [INFO ] Transformed 12 places.
[2023-03-18 07:22:21] [INFO ] Transformed 10 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8286949493800187833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 07:22:21] [INFO ] Time to serialize gal into /tmp/LTLFireability13849800457289849215.gal : 5 ms
[2023-03-18 07:22:21] [INFO ] Time to serialize properties into /tmp/LTLFireability9523532582401938501.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13849800457289849215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9523532582401938501.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X((!("((p12>=1)&&(p7>=1))"))U((G(!("((p12>=1)&&(p7>=1))")))||((!("((p12>=1)&&(p7>=1))"))&&(G("(p3<65535)")))))))))
Formula 0 simplified : XXX(F!"(p3<65535)" U "((p12>=1)&&(p7>=1))")
ITS-tools command line returned an error code 134
terminate called after throwing an instance of 'char const*'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: X(X(X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](!(LTLAPp1==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.005: "X(X(X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](!(LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.094: DFS-FIFO for weak LTL, using special progress label 13
pins2lts-mc-linux64( 0/ 8), 0.094: There are 14 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.094: State length is 13, there are 23 groups
pins2lts-mc-linux64( 0/ 8), 0.094: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.094: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.094: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.094: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.109: ~1 levels ~960 states ~2576 transitions
pins2lts-mc-linux64( 0/ 8), 0.118: ~1 levels ~1920 states ~5200 transitions
pins2lts-mc-linux64( 0/ 8), 0.137: ~1 levels ~3840 states ~10432 transitions
pins2lts-mc-linux64( 0/ 8), 0.170: ~1 levels ~7680 states ~20904 transitions
pins2lts-mc-linux64( 0/ 8), 0.331: ~1 levels ~15360 states ~41832 transitions
pins2lts-mc-linux64( 0/ 8), 0.569: ~1 levels ~30720 states ~84040 transitions
pins2lts-mc-linux64( 0/ 8), 0.929: ~1 levels ~61440 states ~168312 transitions
pins2lts-mc-linux64( 0/ 8), 1.436: ~1 levels ~122880 states ~337288 transitions
pins2lts-mc-linux64( 0/ 8), 2.124: ~1 levels ~245760 states ~674792 transitions
pins2lts-mc-linux64( 0/ 8), 2.968: ~1 levels ~491520 states ~1350264 transitions
pins2lts-mc-linux64( 0/ 8), 3.830: ~1 levels ~983040 states ~2701144 transitions
pins2lts-mc-linux64( 4/ 8), 4.805: ~1 levels ~1966080 states ~5397712 transitions
pins2lts-mc-linux64( 4/ 8), 6.620: ~1 levels ~3932160 states ~10799688 transitions
pins2lts-mc-linux64( 4/ 8), 10.169: ~1 levels ~7864320 states ~21609008 transitions
pins2lts-mc-linux64( 4/ 8), 19.802: ~1 levels ~15728640 states ~43227832 transitions
pins2lts-mc-linux64( 4/ 8), 27.858: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 27.957:
pins2lts-mc-linux64( 0/ 8), 27.957: mean standard work distribution: 0.9% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 27.957:
pins2lts-mc-linux64( 0/ 8), 27.957: Explored 16754920 states 46073103 transitions, fanout: 2.750
pins2lts-mc-linux64( 0/ 8), 27.957: Total exploration time 27.850 sec (27.760 sec minimum, 27.795 sec on average)
pins2lts-mc-linux64( 0/ 8), 27.957: States per second: 601613, Transitions per second: 1654330
pins2lts-mc-linux64( 0/ 8), 27.957:
pins2lts-mc-linux64( 0/ 8), 27.957: Progress states detected: 16761081
pins2lts-mc-linux64( 0/ 8), 27.957: Redundant explorations: -0.0371
pins2lts-mc-linux64( 0/ 8), 27.957:
pins2lts-mc-linux64( 0/ 8), 27.957: Queue width: 8B, total height: 13460, memory: 0.10MB
pins2lts-mc-linux64( 0/ 8), 27.957: Tree memory: 383.9MB, 24.0 B/state, compr.: 44.5%
pins2lts-mc-linux64( 0/ 8), 27.957: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 27.957: Stored 10 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 27.957: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 27.957: Est. total memory use: 384.0MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8286949493800187833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8286949493800187833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Total runtime 117536 ms.

BK_STOP 1679124170374

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SatelliteMemory-PT-X65535Y2048"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SatelliteMemory-PT-X65535Y2048, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r357-smll-167891806200332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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