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.r168-tall-165277016500292.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 Philosophers-PT-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016500292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 11K Apr 29 11:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 11:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 29 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 11:30 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 6.9K May 9 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 9 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 9 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K May 9 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 22K 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 Philosophers-PT-000010-LTLFireability-00
FORMULA_NAME Philosophers-PT-000010-LTLFireability-01
FORMULA_NAME Philosophers-PT-000010-LTLFireability-02
FORMULA_NAME Philosophers-PT-000010-LTLFireability-03
FORMULA_NAME Philosophers-PT-000010-LTLFireability-04
FORMULA_NAME Philosophers-PT-000010-LTLFireability-05
FORMULA_NAME Philosophers-PT-000010-LTLFireability-06
FORMULA_NAME Philosophers-PT-000010-LTLFireability-07
FORMULA_NAME Philosophers-PT-000010-LTLFireability-08
FORMULA_NAME Philosophers-PT-000010-LTLFireability-09
FORMULA_NAME Philosophers-PT-000010-LTLFireability-10
FORMULA_NAME Philosophers-PT-000010-LTLFireability-11
FORMULA_NAME Philosophers-PT-000010-LTLFireability-12
FORMULA_NAME Philosophers-PT-000010-LTLFireability-13
FORMULA_NAME Philosophers-PT-000010-LTLFireability-14
FORMULA_NAME Philosophers-PT-000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652821757735

Running Version 202205111006
[2022-05-17 21:09:18] [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-17 21:09:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:09:19] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2022-05-17 21:09:19] [INFO ] Transformed 50 places.
[2022-05-17 21:09:19] [INFO ] Transformed 50 transitions.
[2022-05-17 21:09:19] [INFO ] Found NUPN structural information;
[2022-05-17 21:09:19] [INFO ] Parsed PT model containing 50 places and 50 transitions in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-000010-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 16 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:19] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 21:09:19] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:19] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:09:19] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:19] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 21:09:19] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Support contains 50 out of 50 places after structural reductions.
[2022-05-17 21:09:19] [INFO ] Flatten gal took : 32 ms
[2022-05-17 21:09:19] [INFO ] Flatten gal took : 11 ms
[2022-05-17 21:09:19] [INFO ] Input system was already deterministic with 50 transitions.
Finished random walk after 112 steps, including 1 resets, run visited all 26 properties in 21 ms. (steps per millisecond=5 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0) U (F(X(X(X(p1))))&&!(G(p1)&&p0)))))'
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:20] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:20] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:20] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 21:09:20] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:20] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 21:09:20] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) p0), (NOT p1), (AND p0 p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s3 1) (EQ s12 1)) (AND (EQ s0 1) (EQ s20 1)) (AND (EQ s1 1) (EQ s10 1)) (AND (EQ s5 1) (EQ s13 1)) (AND (EQ s2 1) (EQ s11 1)) (AND (EQ s6 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 12536 reset in 351 ms.
Stack based approach found an accepted trace after 168 steps with 19 reset with depth 11 and stack size 11 in 1 ms.
FORMULA Philosophers-PT-000010-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-00 finished in 916 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(((G(X(F(p0)))&&p1)||p2)))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:21] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:21] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:21] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-17 21:09:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:21] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s7 1) (EQ s18 1)) (AND (EQ s5 1) (EQ s16 1)) (AND (EQ s9 1) (EQ s20 1)) (AND (EQ s4 1) (EQ s13 1)) (AND (EQ s3 1) (EQ s14 1)) (AND (EQ s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 296 steps with 18 reset in 5 ms.
FORMULA Philosophers-PT-000010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-01 finished in 463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((F(p1)&&p2)))||F(G(p2))))'
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:21] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:21] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:21] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:21] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s15 1) (EQ s25 1)) (AND (EQ s11 1) (EQ s22 1)) (AND (EQ s13 1) (EQ s23 1)) (AND (EQ s17 1) (EQ s27 1)) (AND (EQ s14 1) (EQ s24 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-02 finished in 384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(G(p1))||p0))))'
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:22] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:22] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:22] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (EQ s49 0) (EQ s48 0) (EQ s38 0) (EQ s41 0) (EQ s43 0) (EQ s42 0) (EQ s45 0) (EQ s44 0) (EQ s47 0) (EQ s46 0)), p0:(OR (EQ s49 1) (EQ s48 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-04 finished in 364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!(F(!F(p0))&&G((X(p0)&&p0)))) U p0)))'
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:22] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-05-17 21:09:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:22] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s49 1) (EQ s48 1) (EQ s38 1) (EQ s41 1) (EQ s43 1) (EQ s42 1) (EQ s45 1) (EQ s44 1) (EQ s47 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1494 steps with 214 reset in 7 ms.
FORMULA Philosophers-PT-000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-06 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((F(p1)&&p0)))||X(G(p2)))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 21:09:22] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:22] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-17 21:09:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:22] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (EQ s12 1) (EQ s35 1)) (AND (EQ s13 1) (EQ s33 1)) (AND (EQ s17 1) (EQ s37 1)) (AND (EQ s10 1) (EQ s29 1)) (AND (EQ s16 1) (EQ s34 1)) (AND (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-07 finished in 257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(((p0 U G(p1)) U ((p0 U G(p1))&&p2)))||p3))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 45 transition count 45
Applied a total of 10 rules in 16 ms. Remains 45 /50 variables (removed 5) and now considering 45/50 (removed 5) transitions.
// Phase 1: matrix 45 rows 45 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:22] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 45 rows 45 cols
[2022-05-17 21:09:22] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:23] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-05-17 21:09:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 45 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:23] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/50 places, 45/50 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/50 places, 45/50 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p3), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 0}, { cond=(OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 p2 p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p3 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=4 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={1} source=4 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p3 p2 p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={0} source=4 dest: 2}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) p1 (NOT p0))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s11 1) (EQ s30 1)), p1:(AND (EQ s18 1) (EQ s28 1)), p0:(EQ s44 1), p2:(AND (EQ s11 1) (EQ s30 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 2 ms.
FORMULA Philosophers-PT-000010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-08 finished in 444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 42 transition count 42
Applied a total of 16 rules in 5 ms. Remains 42 /50 variables (removed 8) and now considering 42/50 (removed 8) transitions.
// Phase 1: matrix 42 rows 42 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:23] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:23] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-17 21:09:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:23] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/50 places, 42/50 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/50 places, 42/50 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-09 finished in 196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:23] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:23] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-10 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 (EQ s5 1) (EQ s13 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 436 steps with 65 reset in 3 ms.
FORMULA Philosophers-PT-000010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-10 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(F(p0))||X(p1))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:09:23] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:23] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:23] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:23] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s13 0) (EQ s47 0)), p1:(AND (EQ s4 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-PT-000010-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000010-LTLFireability-12 finished in 777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||p1))&&X(F(((G(p2) U p1)&&p1)))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:24] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:24] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:24] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-17 21:09:24] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:24] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s18 0) (EQ s40 0)), p1:(EQ s38 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-13 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!X(p0))||!p1) U X((X(p3)&&p2))))'
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:24] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:24] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:24] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:25] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:25] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:25] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (NOT p3), (AND p0 (NOT p3)), true, (NOT p3), p0, (AND p0 (NOT p3))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=p2, acceptance={0} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 7}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s18 1)), p2:(AND (EQ s7 1) (EQ s18 1)), p0:(AND (EQ s2 1) (EQ s12 1)), p3:(AND (EQ s15 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-14 finished in 520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(p1))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:25] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:09:25] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:25] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:25] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 21:09:25] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 21:09:25] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s14 0) (EQ s24 0)), p1:(EQ s41 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 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-15 finished in 287 ms.
All properties solved by simple procedures.
Total runtime 6782 ms.

BK_STOP 1652821765777

--------------------
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="Philosophers-PT-000010"
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 Philosophers-PT-000010, 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 r168-tall-165277016500292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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