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-165303241700364.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-FrnCT7x7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241700364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 6.2K Apr 30 11:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 11:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 11:32 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.6K May 9 09:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 92K 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-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 1653128567745

Running Version 202205111006
[2022-05-21 10:22:50] [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 10:22:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 10:22:50] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2022-05-21 10:22:50] [INFO ] Transformed 75 places.
[2022-05-21 10:22:50] [INFO ] Transformed 92 transitions.
[2022-05-21 10:22:50] [INFO ] Parsed PT model containing 75 places and 92 transitions in 487 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 5 formulas.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 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 23 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:51] [INFO ] Computed 38 place invariants in 18 ms
[2022-05-21 10:22:51] [INFO ] Implicit Places using invariants in 503 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:51] [INFO ] Computed 38 place invariants in 8 ms
[2022-05-21 10:22:51] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:51] [INFO ] Computed 38 place invariants in 6 ms
[2022-05-21 10:22:52] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Support contains 41 out of 75 places after structural reductions.
[2022-05-21 10:22:52] [INFO ] Flatten gal took : 96 ms
[2022-05-21 10:22:52] [INFO ] Flatten gal took : 75 ms
[2022-05-21 10:22:52] [INFO ] Input system was already deterministic with 92 transitions.
Finished random walk after 304 steps, including 12 resets, run visited all 22 properties in 70 ms. (steps per millisecond=4 )
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(F(p0))||X((G(p0)||p1))))))'
Support contains 6 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.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:53] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:22:53] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:53] [INFO ] Computed 38 place invariants in 6 ms
[2022-05-21 10:22:53] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:53] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:22:53] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s20 1) (GEQ s23 1) (GEQ s36 1) (GEQ s74 1)), p0:(AND (GEQ s23 1) (GEQ s26 1) (GEQ s39 1) (GEQ s74 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 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 990 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
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 4 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:54] [INFO ] Computed 38 place invariants in 3 ms
[2022-05-21 10:22:54] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:54] [INFO ] Computed 38 place invariants in 3 ms
[2022-05-21 10:22:54] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:54] [INFO ] Computed 38 place invariants in 7 ms
[2022-05-21 10:22:54] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s22 1) (LT s37 1) (LT s64 1) (LT s74 1)), p1:(OR (LT s4 1) (LT s15 1) (LT s19 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 5 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 813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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 4 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:55] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:22:55] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:55] [INFO ] Computed 38 place invariants in 3 ms
[2022-05-21 10:22:55] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:55] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:22:55] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (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=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:(OR (LT s34 1) (LT s42 1) (LT s49 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][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-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-03 finished in 785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (X(p0)&&p1)) U 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 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:55] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:22:56] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:56] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:22:56] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:56] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:22:56] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s49 1) (GEQ s53 1) (GEQ s54 1) (GEQ s74 1)), p1:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s17 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, null][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-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-04 finished in 975 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(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 4 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:56] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:22:57] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:57] [INFO ] Computed 38 place invariants in 4 ms
[2022-05-21 10:22:57] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:57] [INFO ] Computed 38 place invariants in 3 ms
[2022-05-21 10:22:57] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-05 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 s43 1) (LT s49 1) (LT s56 1) (LT 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]]
Product exploration explored 100000 steps with 31417 reset in 866 ms.
Product exploration explored 100000 steps with 31313 reset in 660 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 (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-05 finished in 2636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(G((F(F(p1))||p0)))))))'
Support contains 7 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.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:59] [INFO ] Computed 38 place invariants in 0 ms
[2022-05-21 10:22:59] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:59] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:22:59] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2022-05-21 10:22:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:22:59] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:23:00] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s50 1) (LT s68 1) (LT s73 1) (LT s74 1)), p1:(AND (GEQ s7 1) (GEQ s42 1) (GEQ s51 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4198 reset in 766 ms.
Product exploration explored 100000 steps with 4191 reset in 479 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 351 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-06 finished in 2268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X((X(G(p1))&&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 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:01] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:23:01] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:02] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:23:02] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:02] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:23:02] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s24 1) (GEQ s29 1) (GEQ s39 1) (GEQ s74 1)), p1:(AND (GEQ s7 1) (GEQ s42 1) (GEQ s51 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-09 finished in 946 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((G(F(p0))&&p1)))&&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 12 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:02] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:23:02] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:02] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:23:03] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2022-05-21 10:23:03] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:03] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:23:03] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LT s8 1) (LT s48 1) (LT s52 1) (LT s74 1)), p1:(OR (LT s25 1) (LT s33 1) (LT s37 1) (LT s74 1)), p0:(OR (LT s13 1) (LT s20 1) (LT s28 1) (LT s74 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5214 reset in 719 ms.
Product exploration explored 100000 steps with 5208 reset in 435 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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 450 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-12 finished in 2485 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((!(p0 U p1)||X(p2)))||G(p3))))'
Support contains 12 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.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:05] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:23:05] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:05] [INFO ] Computed 38 place invariants in 7 ms
[2022-05-21 10:23:05] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:05] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:23:05] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 548 ms :[true, (NOT p2), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p3)), p1, (AND p1 (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2)), (NOT p3)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 8}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 p3 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p3 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 8}, { cond=(AND p1 p3), acceptance={} source=6 dest: 9}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND p1 p3), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=p1, acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(NOT p3), acceptance={} source=9 dest: 0}, { cond=p3, acceptance={} source=9 dest: 9}]], initial=7, aps=[p2:(OR (LT s1 1) (LT s2 1) (LT s17 1) (LT s74 1)), p1:(AND (GEQ s41 1) (GEQ s51 1) (GEQ s54 1) (GEQ s74 1)), p0:(AND (GEQ s1 1) (GEQ s15 1) (GEQ s20 1) (G...], 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][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 263 steps with 10 reset in 3 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-13 finished in 1213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F(F(G(p1)))))'
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.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:06] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:23:06] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:06] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:23:06] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:06] [INFO ] Computed 38 place invariants in 3 ms
[2022-05-21 10:23:07] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s37 1) (GEQ s40 1) (GEQ s50 1) (GEQ s74 1)), p1:(AND (GEQ s49 1) (GEQ s54 1) (GEQ s70 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 52 steps with 2 reset in 0 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-14 finished in 821 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!p0 U p1)||(X(p0) U (X(p2)||G(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.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:07] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-21 10:23:07] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:07] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:23:07] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 75 cols
[2022-05-21 10:23:07] [INFO ] Computed 38 place invariants in 2 ms
[2022-05-21 10:23:07] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 313 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1)]
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=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(AND (GEQ s37 1) (GEQ s60 1) (GEQ s64 1) (GEQ s74 1)), p0:(AND (GEQ s19 1) (GEQ s29 1) (GEQ s39 1) (GEQ s74 1)), p2:(AND (GEQ s4 1) (GEQ s13 1) (GEQ s1...], 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, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-15 finished in 890 ms.
All properties solved by simple procedures.
Total runtime 17947 ms.

BK_STOP 1653128588611

--------------------
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-FrnCT7x7"
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-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 r240-smll-165303241700364"
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 ;