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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 13:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K 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 Solitaire-PT-FrnCT7x7-LTLFireability-00
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-01
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-02
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-03
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-04
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-05
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-06
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-07
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-08
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-09
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-10
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-11
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-12
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-13
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-14
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679220855200

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Solitaire-PT-FrnCT7x7
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 10:14:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 10:14:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:14:18] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-19 10:14:18] [INFO ] Transformed 75 places.
[2023-03-19 10:14:18] [INFO ] Transformed 92 transitions.
[2023-03-19 10:14:18] [INFO ] Parsed PT model containing 75 places and 92 transitions and 644 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 16 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 75 cols
[2023-03-19 10:14:19] [INFO ] Computed 38 place invariants in 15 ms
[2023-03-19 10:14:19] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-19 10:14:19] [INFO ] Invariant cache hit.
[2023-03-19 10:14:19] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-19 10:14:19] [INFO ] Invariant cache hit.
[2023-03-19 10:14:20] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 75/75 places, 92/92 transitions.
Support contains 49 out of 75 places after structural reductions.
[2023-03-19 10:14:20] [INFO ] Flatten gal took : 59 ms
[2023-03-19 10:14:20] [INFO ] Flatten gal took : 28 ms
[2023-03-19 10:14:20] [INFO ] Input system was already deterministic with 92 transitions.
Finished random walk after 474 steps, including 18 resets, run visited all 24 properties in 68 ms. (steps per millisecond=6 )
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 : '/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(F(p0)) U G((p1 U !p2))))&&X(p0)))'
Support contains 9 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:21] [INFO ] Invariant cache hit.
[2023-03-19 10:14:21] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-19 10:14:21] [INFO ] Invariant cache hit.
[2023-03-19 10:14:21] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-19 10:14:21] [INFO ] Invariant cache hit.
[2023-03-19 10:14:21] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 670 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 510 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, (NOT p0), p2, p2]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s12 1) (GEQ s17 1) (GEQ s74 1)), p2:(AND (GEQ s36 1) (GEQ s40 1) (GEQ s51 1) (GEQ s74 1)), p1:(AND (GEQ s4 1) (GEQ s15 1) (GEQ s19...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-00 finished in 1294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&F(p2)&&p0))))'
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:22] [INFO ] Invariant cache hit.
[2023-03-19 10:14:22] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-19 10:14:22] [INFO ] Invariant cache hit.
[2023-03-19 10:14:22] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-19 10:14:22] [INFO ] Invariant cache hit.
[2023-03-19 10:14:22] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s49 1) (GEQ s53 1) (GEQ s54 1) (GEQ s74 1)), p1:(AND (GEQ s5 1) (GEQ s15 1) (GEQ s18 1) (GEQ s74 1)), p2:(AND (GEQ s13 1) (GEQ s35 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-01 finished in 855 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(G(p0)))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:23] [INFO ] Invariant cache hit.
[2023-03-19 10:14:23] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-19 10:14:23] [INFO ] Invariant cache hit.
[2023-03-19 10:14:23] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-19 10:14:23] [INFO ] Invariant cache hit.
[2023-03-19 10:14:23] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s25 1) (GEQ s39 1) (GEQ s62 1) (GEQ s74 1) (OR (LT s21 1) (LT s23 1) (LT s37 1) (LT s74 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-03 finished in 795 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||G(p1)||(F(p3)&&p2))))'
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 25 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:24] [INFO ] Invariant cache hit.
[2023-03-19 10:14:24] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-19 10:14:24] [INFO ] Invariant cache hit.
[2023-03-19 10:14:24] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-19 10:14:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 10:14:24] [INFO ] Invariant cache hit.
[2023-03-19 10:14:24] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 506 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s59 1) (LT s62 1) (LT s64 1) (LT s74 1)), p0:(AND (GEQ s42 1) (GEQ s49 1) (GEQ s57 1) (GEQ s74 1)), p2:(AND (GEQ s21 1) (GEQ s29 1) (GEQ s30 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6199 reset in 773 ms.
Product exploration explored 100000 steps with 6218 reset in 899 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 p1 (NOT p0) (NOT p2) (NOT p3)), (X (AND p1 (NOT p0) (NOT p3))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 11 factoid took 433 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-05 finished in 2847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:26] [INFO ] Invariant cache hit.
[2023-03-19 10:14:26] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 10:14:26] [INFO ] Invariant cache hit.
[2023-03-19 10:14:27] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-19 10:14:27] [INFO ] Invariant cache hit.
[2023-03-19 10:14:27] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s59 1) (GEQ s64 1) (GEQ s69 1) (GEQ s74 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]]
Stuttering criterion allowed to conclude after 36 steps with 1 reset in 1 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-08 finished in 496 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(X(F((X(p0) U p1))))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:27] [INFO ] Invariant cache hit.
[2023-03-19 10:14:27] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-19 10:14:27] [INFO ] Invariant cache hit.
[2023-03-19 10:14:27] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2023-03-19 10:14:27] [INFO ] Invariant cache hit.
[2023-03-19 10:14:27] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s4 1) (GEQ s15 1) (GEQ s19 1) (GEQ s74 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]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-09 finished in 748 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(!p1))) U (G(F((!p0||X(!p1))))||(F((!p0||X(!p1)))&&p2))))'
Support contains 11 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:28] [INFO ] Invariant cache hit.
[2023-03-19 10:14:28] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-19 10:14:28] [INFO ] Invariant cache hit.
[2023-03-19 10:14:28] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-19 10:14:28] [INFO ] Invariant cache hit.
[2023-03-19 10:14:28] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s13 1) (GEQ s21 1) (GEQ s74 1)), p0:(OR (AND (GEQ s13 1) (GEQ s20 1) (GEQ s28 1) (GEQ s74 1)) (AND (GEQ s6 1) (GEQ s11 1) (GEQ s43...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9541 reset in 726 ms.
Product exploration explored 100000 steps with 9452 reset in 560 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 p2) (NOT p0) (NOT p1)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-10 finished in 2578 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))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:30] [INFO ] Invariant cache hit.
[2023-03-19 10:14:30] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-19 10:14:30] [INFO ] Invariant cache hit.
[2023-03-19 10:14:31] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-19 10:14:31] [INFO ] Invariant cache hit.
[2023-03-19 10:14:31] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s11 1) (GEQ s14 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-12 finished in 845 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 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:31] [INFO ] Invariant cache hit.
[2023-03-19 10:14:31] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-19 10:14:31] [INFO ] Invariant cache hit.
[2023-03-19 10:14:31] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-19 10:14:31] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 10:14:31] [INFO ] Invariant cache hit.
[2023-03-19 10:14:32] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 710 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-13 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 s8 1) (LT s48 1) (LT s52 1) (LT s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3870 reset in 651 ms.
Product exploration explored 100000 steps with 3879 reset in 472 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-13 finished in 2102 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((X((p0 U !p1))&&G(p2))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:33] [INFO ] Invariant cache hit.
[2023-03-19 10:14:33] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-19 10:14:33] [INFO ] Invariant cache hit.
[2023-03-19 10:14:34] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-19 10:14:34] [INFO ] Invariant cache hit.
[2023-03-19 10:14:34] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 p1) (AND p1 p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (OR (LT s37 1) (LT s60 1) (LT s64 1) (LT s74 1)) (OR (LT s22 1) (LT s27 1) (LT s39 1) (LT s74 1))), p1:(AND (GEQ s37 1) (GEQ s60 1) (GEQ s64 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8478 reset in 692 ms.
Product exploration explored 100000 steps with 8388 reset in 568 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 p1) (AND p1 p0)))), (X p2), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 p1) (AND p1 p0))))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p1) (NOT p0))
Knowledge based reduction with 11 factoid took 575 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-14 finished in 2863 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)||p1) U !p2)||X(X(G(!p1)))))'
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-19 10:14:36] [INFO ] Invariant cache hit.
[2023-03-19 10:14:36] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-19 10:14:36] [INFO ] Invariant cache hit.
[2023-03-19 10:14:36] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-19 10:14:36] [INFO ] Invariant cache hit.
[2023-03-19 10:14:37] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 645 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 679 ms :[true, p1, p0, (AND p1 p0), (NOT p2), (AND p0 (NOT p2)), (AND p1 p0 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, (AND p0 (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND p1 p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 10}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=8 dest: 11}], [{ cond=true, acceptance={} source=9 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 6}, { cond=(AND p0 p2), acceptance={} source=10 dest: 7}], [{ cond=(NOT p2), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=11 dest: 6}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=11 dest: 7}]], initial=8, aps=[p1:(AND (GEQ s27 1) (GEQ s30 1) (GEQ s33 1) (GEQ s74 1)), p0:(AND (GEQ s5 1) (GEQ s8 1) (GEQ s11 1) (GEQ s74 1)), p2:(AND (GEQ s45 1) (GEQ s46 1) (GEQ s56...], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 1 reset in 1 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-15 finished in 1355 ms.
All properties solved by simple procedures.
Total runtime 19208 ms.
ITS solved all properties within timeout

BK_STOP 1679220879313

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Solitaire-PT-FrnCT7x7, 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 r455-smll-167912647200324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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