Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241700380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Solitaire-PT-SqrCT5x5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241700380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 8.5K Apr 30 11:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 11:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 30 11:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 30 11:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 09:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 09:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 76K May 10 09:34 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 Solitaire-PT-SqrCT5x5-LTLFireability-00
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-01
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-02
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-03
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-04
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-05
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-06
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-07
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-08
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-09
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-10
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-11
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-12
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-13
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-14
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653143026764

Running Version 202205111006
[2022-05-21 14:23:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 14:23:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 14:23:49] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2022-05-21 14:23:49] [INFO ] Transformed 51 places.
[2022-05-21 14:23:49] [INFO ] Transformed 84 transitions.
[2022-05-21 14:23:49] [INFO ] Parsed PT model containing 51 places and 84 transitions in 414 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 21 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:50] [INFO ] Computed 25 place invariants in 20 ms
[2022-05-21 14:23:50] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:50] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-21 14:23:50] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:50] [INFO ] Computed 25 place invariants in 9 ms
[2022-05-21 14:23:50] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Support contains 40 out of 51 places after structural reductions.
[2022-05-21 14:23:51] [INFO ] Flatten gal took : 83 ms
[2022-05-21 14:23:51] [INFO ] Flatten gal took : 42 ms
[2022-05-21 14:23:51] [INFO ] Input system was already deterministic with 84 transitions.
Support contains 37 out of 51 places (down from 40) after GAL structural reductions.
Finished random walk after 2363 steps, including 107 resets, run visited all 23 properties in 141 ms. (steps per millisecond=16 )
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:51] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 14:23:52] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:52] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-21 14:23:52] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:52] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 14:23:52] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s16 1) (LT s23 1) (LT s30 1) (LT s50 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 32093 reset in 790 ms.
Product exploration explored 100000 steps with 32100 reset in 420 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-01 finished in 2388 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(!(F(X(p0)) U X(p1))) U X(p2))))'
Support contains 8 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:54] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:23:54] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:54] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-21 14:23:54] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:54] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-21 14:23:54] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 667 ms :[p2, p2, p2, true, (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s11 1) (GEQ s15 1) (GEQ s50 1)), p1:(AND (GEQ s19 1) (GEQ s25 1) (GEQ s50 1)), p0:(AND (GEQ s2 1) (GEQ s9 1) (GEQ s37 1) (GEQ s50 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 5 reset in 1 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-03 finished in 1058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 16 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:55] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:23:55] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:55] [INFO ] Computed 25 place invariants in 6 ms
[2022-05-21 14:23:55] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2022-05-21 14:23:55] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:55] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 14:23:55] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s17 1) (LT s23 1) (LT s31 1) (LT s50 1))], 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]]
Product exploration explored 100000 steps with 24559 reset in 581 ms.
Product exploration explored 100000 steps with 24563 reset in 348 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-04 finished in 1702 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(!(X(X(p0)) U p1)))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:57] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:23:57] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:57] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-21 14:23:57] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:57] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 14:23:57] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 229 ms :[p1, p1, (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s33 1) (GEQ s36 1) (GEQ s39 1) (GEQ s50 1)), p0:(OR (AND (GEQ s33 1) (GEQ s36 1) (GEQ s39 1) (GEQ s50 1)) (AND (GEQ s35 1) (GEQ s38 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13093 reset in 685 ms.
Product exploration explored 100000 steps with 12999 reset in 487 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 3 factoid took 262 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-05 finished in 2058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((!(p0 U p1)&&F(!p0))))))'
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:59] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:23:59] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:59] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-21 14:23:59] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2022-05-21 14:23:59] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:23:59] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 14:23:59] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR p0 p1), (OR p1 p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s23 1) (GEQ s29 1) (GEQ s50 1)), p1:(AND (GEQ s10 1) (GEQ s14 1) (GEQ s17 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6942 reset in 686 ms.
Product exploration explored 100000 steps with 6952 reset in 412 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1))))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR p0 p1), (OR p1 p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (F (OR p0 p1))]
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR p0 p1), (OR p1 p0)]
Stuttering acceptance computed with spot in 104 ms :[(OR p0 p1), (OR p1 p0)]
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:24:01] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:24:01] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:24:01] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 14:24:02] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2022-05-21 14:24:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:24:02] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:24:02] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1))))]
Knowledge based reduction with 3 factoid took 276 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR p0 p1), (OR p1 p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (F (OR p0 p1))]
Knowledge based reduction with 3 factoid took 314 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR p0 p1), (OR p1 p0)]
Stuttering acceptance computed with spot in 102 ms :[(OR p0 p1), (OR p1 p0)]
Stuttering acceptance computed with spot in 107 ms :[(OR p0 p1), (OR p1 p0)]
Product exploration explored 100000 steps with 6872 reset in 618 ms.
Product exploration explored 100000 steps with 6982 reset in 604 ms.
Built C files in :
/tmp/ltsmin17382533288874378573
[2022-05-21 14:24:04] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2022-05-21 14:24:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:24:04] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2022-05-21 14:24:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:24:04] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2022-05-21 14:24:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:24:04] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17382533288874378573
Running compilation step : cd /tmp/ltsmin17382533288874378573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 692 ms.
Running link step : cd /tmp/ltsmin17382533288874378573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin17382533288874378573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1743256102336278197.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:24:19] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:24:19] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:24:19] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:24:19] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2022-05-21 14:24:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:24:19] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-21 14:24:19] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin13240876370488797449
[2022-05-21 14:24:19] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2022-05-21 14:24:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:24:19] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2022-05-21 14:24:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:24:19] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2022-05-21 14:24:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:24:19] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13240876370488797449
Running compilation step : cd /tmp/ltsmin13240876370488797449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 513 ms.
Running link step : cd /tmp/ltsmin13240876370488797449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13240876370488797449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6005291509578677299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 14:24:35] [INFO ] Flatten gal took : 23 ms
[2022-05-21 14:24:35] [INFO ] Flatten gal took : 43 ms
[2022-05-21 14:24:35] [INFO ] Time to serialize gal into /tmp/LTL7268234915780798412.gal : 4 ms
[2022-05-21 14:24:35] [INFO ] Time to serialize properties into /tmp/LTL13329403379996178963.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7268234915780798412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13329403379996178963.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7268234...267
Read 1 LTL properties
Checking formula 0 : !((X(G(F((!(("(((T43>=1)&&(T44>=1))&&((F45>=1)&&(counter>=1)))")U("(((F32>=1)&&(T33>=1))&&((T34>=1)&&(counter>=1)))")))&&(F("(((T43<1)...198
Formula 0 simplified : !XGF(!("(((T43>=1)&&(T44>=1))&&((F45>=1)&&(counter>=1)))" U "(((F32>=1)&&(T33>=1))&&((T34>=1)&&(counter>=1)))") & F"(((T43<1)||(T44<...185
Detected timeout of ITS tools.
[2022-05-21 14:24:50] [INFO ] Flatten gal took : 13 ms
[2022-05-21 14:24:50] [INFO ] Applying decomposition
[2022-05-21 14:24:50] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1771779468272783918.txt' '-o' '/tmp/graph1771779468272783918.bin' '-w' '/tmp/graph1771779468272783918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1771779468272783918.bin' '-l' '-1' '-v' '-w' '/tmp/graph1771779468272783918.weights' '-q' '0' '-e' '0.001'
[2022-05-21 14:24:50] [INFO ] Decomposing Gal with order
[2022-05-21 14:24:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 14:24:50] [INFO ] Removed a total of 249 redundant transitions.
[2022-05-21 14:24:50] [INFO ] Flatten gal took : 74 ms
[2022-05-21 14:24:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-21 14:24:50] [INFO ] Time to serialize gal into /tmp/LTL17044538986996522287.gal : 7 ms
[2022-05-21 14:24:50] [INFO ] Time to serialize properties into /tmp/LTL5180211729512650614.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17044538986996522287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5180211729512650614.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1704453...246
Read 1 LTL properties
Checking formula 0 : !((X(G(F((!(("(((i0.u4.T43>=1)&&(i0.u11.T44>=1))&&((i4.i1.u14.F45>=1)&&(i4.i0.u17.counter>=1)))")U("(((i1.i0.u5.F32>=1)&&(i1.i0.u7.T33...301
Formula 0 simplified : !XGF(!("(((i0.u4.T43>=1)&&(i0.u11.T44>=1))&&((i4.i1.u14.F45>=1)&&(i4.i0.u17.counter>=1)))" U "(((i1.i0.u5.F32>=1)&&(i1.i0.u7.T33>=1)...288
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11104504687578109563
[2022-05-21 14:25:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11104504687578109563
Running compilation step : cd /tmp/ltsmin11104504687578109563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 260 ms.
Running link step : cd /tmp/ltsmin11104504687578109563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11104504687578109563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((!((LTLAPp0==true) U (LTLAPp1==true))&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-06 finished in 81523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:20] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:20] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:20] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-21 14:25:20] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:20] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 14:25:20] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s14 1) (GEQ s21 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-08 finished in 421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0)&&F(X(p1))))&&G(p1))))'
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:21] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:21] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:21] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 14:25:21] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2022-05-21 14:25:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:21] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:21] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s17 1) (GEQ s23 1) (GEQ s26 1) (GEQ s50 1)), p0:(OR (LT s25 1) (LT s28 1) (LT s34 1) (LT s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-10 finished in 622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(F(X(G((X(p0)||p1))))))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:21] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:21] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:21] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:21] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:22] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-21 14:25:22] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s32 1) (GEQ s38 1) (GEQ s49 1) (GEQ s50 1)), p0:(OR (LT s17 1) (LT s27 1) (LT s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4621 reset in 656 ms.
Product exploration explored 100000 steps with 4609 reset in 430 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 432 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-12 finished in 2165 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((F(p0)||(F(p1)&&!p0))))))'
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:23] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-21 14:25:23] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:23] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:24] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-05-21 14:25:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:24] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:24] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s30 1) (GEQ s32 1) (GEQ s50 1)), p1:(OR (LT s24 1) (LT s28 1) (LT s35 1) (LT s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6313 reset in 600 ms.
Product exploration explored 100000 steps with 6296 reset in 606 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G (NOT p0))), (F (G 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)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-13 finished in 1842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))||F((X(p1)||p2))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:25] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:25] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:25] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:25] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:25] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:25] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s15 1) (GEQ s21 1) (GEQ s50 1)), p2:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s7 1) (GEQ s50 1)), p0:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s7 1) (GEQ s50 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]]
Stuttering criterion allowed to conclude after 98 steps with 7 reset in 1 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-14 finished in 471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))||G(p1))))'
Support contains 8 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:26] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:26] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:26] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-21 14:25:26] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2022-05-21 14:25:26] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 84 rows 51 cols
[2022-05-21 14:25:26] [INFO ] Computed 25 place invariants in 7 ms
[2022-05-21 14:25:26] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s7 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s22 1) (GEQ s50 1))), p1:(AND (GEQ s3 1) (GEQ s36 1) (GEQ s50 1))], nbAcceptance=2, 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 20 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-15 finished in 503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((!(p0 U p1)&&F(!p0))))))'
[2022-05-21 14:25:27] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15782991090942696844
[2022-05-21 14:25:27] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2022-05-21 14:25:27] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:25:27] [INFO ] Applying decomposition
[2022-05-21 14:25:27] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2022-05-21 14:25:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:25:27] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2022-05-21 14:25:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 14:25:27] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15782991090942696844
Running compilation step : cd /tmp/ltsmin15782991090942696844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 14:25:27] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9864243847272678195.txt' '-o' '/tmp/graph9864243847272678195.bin' '-w' '/tmp/graph9864243847272678195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9864243847272678195.bin' '-l' '-1' '-v' '-w' '/tmp/graph9864243847272678195.weights' '-q' '0' '-e' '0.001'
[2022-05-21 14:25:27] [INFO ] Decomposing Gal with order
[2022-05-21 14:25:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 14:25:27] [INFO ] Removed a total of 249 redundant transitions.
[2022-05-21 14:25:27] [INFO ] Flatten gal took : 36 ms
[2022-05-21 14:25:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-21 14:25:27] [INFO ] Time to serialize gal into /tmp/LTLFireability1787310597938334667.gal : 4 ms
[2022-05-21 14:25:27] [INFO ] Time to serialize properties into /tmp/LTLFireability3807534958121272513.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1787310597938334667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3807534958121272513.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X(G(F((!(("(((i0.u4.T43>=1)&&(i0.u11.T44>=1))&&((i3.i0.u14.F45>=1)&&(i3.i1.u17.counter>=1)))")U("(((i1.i0.u5.F32>=1)&&(i1.i0.u7.T33...301
Formula 0 simplified : !XGF(!("(((i0.u4.T43>=1)&&(i0.u11.T44>=1))&&((i3.i0.u14.F45>=1)&&(i3.i1.u17.counter>=1)))" U "(((i1.i0.u5.F32>=1)&&(i1.i0.u7.T33>=1)...288
Compilation finished in 548 ms.
Running link step : cd /tmp/ltsmin15782991090942696844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15782991090942696844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((!((LTLAPp0==true) U (LTLAPp1==true))&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: LTL layer: formula: X([](<>((!((LTLAPp0==true) U (LTLAPp1==true))&&<>(!(LTLAPp0==true))))))
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
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.004: "X([](<>((!((LTLAPp0==true) U (LTLAPp1==true))&&<>(!(LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: 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( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.022: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.071: DFS-FIFO for weak LTL, using special progress label 87
pins2lts-mc-linux64( 0/ 8), 0.071: There are 88 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.071: State length is 52, there are 89 groups
pins2lts-mc-linux64( 0/ 8), 0.071: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.071: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.071: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.071: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.154: ~20 levels ~960 states ~2568 transitions
pins2lts-mc-linux64( 1/ 8), 0.179: ~18 levels ~1920 states ~4952 transitions
pins2lts-mc-linux64( 1/ 8), 0.208: ~18 levels ~3840 states ~7552 transitions
pins2lts-mc-linux64( 3/ 8), 0.253: ~23 levels ~7680 states ~11872 transitions
pins2lts-mc-linux64( 2/ 8), 0.344: ~23 levels ~15360 states ~22176 transitions
pins2lts-mc-linux64( 1/ 8), 0.494: ~23 levels ~30720 states ~43352 transitions
pins2lts-mc-linux64( 1/ 8), 0.798: ~23 levels ~61440 states ~90656 transitions
pins2lts-mc-linux64( 1/ 8), 1.291: ~23 levels ~122880 states ~192248 transitions
pins2lts-mc-linux64( 1/ 8), 2.117: ~23 levels ~245760 states ~399520 transitions
pins2lts-mc-linux64( 1/ 8), 3.362: ~23 levels ~491520 states ~845256 transitions
pins2lts-mc-linux64( 5/ 8), 4.894: ~23 levels ~983040 states ~1909704 transitions
pins2lts-mc-linux64( 5/ 8), 7.235: ~23 levels ~1966080 states ~4141472 transitions
pins2lts-mc-linux64( 1/ 8), 11.889: ~23 levels ~3932160 states ~8603224 transitions
pins2lts-mc-linux64( 1/ 8), 21.627: ~23 levels ~7864320 states ~19184440 transitions
pins2lts-mc-linux64( 1/ 8), 42.228: ~23 levels ~15728640 states ~42221152 transitions
pins2lts-mc-linux64( 5/ 8), 85.814: ~23 levels ~31457280 states ~95275992 transitions
pins2lts-mc-linux64( 5/ 8), 178.647: ~23 levels ~62914560 states ~211326064 transitions
pins2lts-mc-linux64( 5/ 8), 390.915: ~23 levels ~125829120 states ~485450992 transitions
pins2lts-mc-linux64( 4/ 8), 450.513: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 450.633:
pins2lts-mc-linux64( 0/ 8), 450.633: mean standard work distribution: 3.2% (states) 1.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 450.633:
pins2lts-mc-linux64( 0/ 8), 450.633: Explored 129706401 states 551267767 transitions, fanout: 4.250
pins2lts-mc-linux64( 0/ 8), 450.633: Total exploration time 450.560 sec (450.470 sec minimum, 450.505 sec on average)
pins2lts-mc-linux64( 0/ 8), 450.633: States per second: 287878, Transitions per second: 1223517
pins2lts-mc-linux64( 0/ 8), 450.633:
pins2lts-mc-linux64( 0/ 8), 450.633: Progress states detected: 6299051
pins2lts-mc-linux64( 0/ 8), 450.633: Redundant explorations: -3.3609
pins2lts-mc-linux64( 0/ 8), 450.633:
pins2lts-mc-linux64( 0/ 8), 450.633: Queue width: 8B, total height: 7134100, memory: 54.43MB
pins2lts-mc-linux64( 0/ 8), 450.633: Tree memory: 1025.2MB, 8.0 B/state, compr.: 3.8%
pins2lts-mc-linux64( 0/ 8), 450.633: Tree fill ratio (roots/leafs): 99.0%/0.0%
pins2lts-mc-linux64( 0/ 8), 450.633: Stored 84 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 450.633: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 450.633: Est. total memory use: 1079.6MB (~1078.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15782991090942696844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((!((LTLAPp0==true) U (LTLAPp1==true))&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15782991090942696844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>((!((LTLAPp0==true) U (LTLAPp1==true))&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 14:45:59] [INFO ] Flatten gal took : 12 ms
[2022-05-21 14:45:59] [INFO ] Time to serialize gal into /tmp/LTLFireability18055758335107473876.gal : 3 ms
[2022-05-21 14:45:59] [INFO ] Time to serialize properties into /tmp/LTLFireability1674370572374539488.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18055758335107473876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1674370572374539488.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((X(G(F((!(("(((T43>=1)&&(T44>=1))&&((F45>=1)&&(counter>=1)))")U("(((F32>=1)&&(T33>=1))&&((T34>=1)&&(counter>=1)))")))&&(F("(((T43<1)...198
Formula 0 simplified : !XGF(!("(((T43>=1)&&(T44>=1))&&((F45>=1)&&(counter>=1)))" U "(((F32>=1)&&(T33>=1))&&((T34>=1)&&(counter>=1)))") & F"(((T43<1)||(T44<...185
Detected timeout of ITS tools.
[2022-05-21 15:06:34] [INFO ] Flatten gal took : 568 ms
[2022-05-21 15:06:36] [INFO ] Input system was already deterministic with 84 transitions.
[2022-05-21 15:06:36] [INFO ] Transformed 51 places.
[2022-05-21 15:06:36] [INFO ] Transformed 84 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 15:06:37] [INFO ] Time to serialize gal into /tmp/LTLFireability16770279805648639936.gal : 20 ms
[2022-05-21 15:06:37] [INFO ] Time to serialize properties into /tmp/LTLFireability9194062802200970777.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16770279805648639936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9194062802200970777.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(F((!(("(((T43>=1)&&(T44>=1))&&((F45>=1)&&(counter>=1)))")U("(((F32>=1)&&(T33>=1))&&((T34>=1)&&(counter>=1)))")))&&(F("(((T43<1)...198
Formula 0 simplified : !XGF(!("(((T43>=1)&&(T44>=1))&&((F45>=1)&&(counter>=1)))" U "(((F32>=1)&&(T33>=1))&&((T34>=1)&&(counter>=1)))") & F"(((T43<1)||(T44<...185

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Solitaire-PT-SqrCT5x5"
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-4028"
echo " Executing tool itstools"
echo " Input is Solitaire-PT-SqrCT5x5, 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 r240-smll-165303241700380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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