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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 78K Apr 29 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 476K Apr 29 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 63K Apr 29 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 441K Apr 29 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 45K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 192K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 127K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K May 9 08:26 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 215K 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-000100-LTLFireability-00
FORMULA_NAME Philosophers-PT-000100-LTLFireability-01
FORMULA_NAME Philosophers-PT-000100-LTLFireability-02
FORMULA_NAME Philosophers-PT-000100-LTLFireability-03
FORMULA_NAME Philosophers-PT-000100-LTLFireability-04
FORMULA_NAME Philosophers-PT-000100-LTLFireability-05
FORMULA_NAME Philosophers-PT-000100-LTLFireability-06
FORMULA_NAME Philosophers-PT-000100-LTLFireability-07
FORMULA_NAME Philosophers-PT-000100-LTLFireability-08
FORMULA_NAME Philosophers-PT-000100-LTLFireability-09
FORMULA_NAME Philosophers-PT-000100-LTLFireability-10
FORMULA_NAME Philosophers-PT-000100-LTLFireability-11
FORMULA_NAME Philosophers-PT-000100-LTLFireability-12
FORMULA_NAME Philosophers-PT-000100-LTLFireability-13
FORMULA_NAME Philosophers-PT-000100-LTLFireability-14
FORMULA_NAME Philosophers-PT-000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652823563698

Running Version 202205111006
[2022-05-17 21:39:24] [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:39:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:39:25] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2022-05-17 21:39:25] [INFO ] Transformed 500 places.
[2022-05-17 21:39:25] [INFO ] Transformed 500 transitions.
[2022-05-17 21:39:25] [INFO ] Found NUPN structural information;
[2022-05-17 21:39:25] [INFO ] Parsed PT model containing 500 places and 500 transitions in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-PT-000100-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:25] [INFO ] Computed 200 place invariants in 23 ms
[2022-05-17 21:39:25] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:25] [INFO ] Computed 200 place invariants in 9 ms
[2022-05-17 21:39:26] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:26] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-17 21:39:26] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2022-05-17 21:39:26] [INFO ] Flatten gal took : 71 ms
[2022-05-17 21:39:26] [INFO ] Flatten gal took : 44 ms
[2022-05-17 21:39:26] [INFO ] Input system was already deterministic with 500 transitions.
Finished random walk after 6853 steps, including 2 resets, run visited all 23 properties in 227 ms. (steps per millisecond=30 )
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' '!(G(X(G(p0))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 37 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:27] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 21:39:27] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:27] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 21:39:28] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:28] [INFO ] Computed 200 place invariants in 6 ms
[2022-05-17 21:39:28] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-00 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 (AND (EQ s28 1) (EQ s133 1)) (AND (EQ s87 1) (EQ s204 1)) (AND (EQ s64 1) (EQ s158 1)) (AND (EQ s74 1) (EQ s164 1)) (AND (EQ s37 1) (EQ s129 1)) (A...], 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 618 steps with 0 reset in 19 ms.
FORMULA Philosophers-PT-000100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-00 finished in 1175 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 28 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:28] [INFO ] Computed 200 place invariants in 6 ms
[2022-05-17 21:39:29] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:29] [INFO ] Computed 200 place invariants in 18 ms
[2022-05-17 21:39:29] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:29] [INFO ] Computed 200 place invariants in 6 ms
[2022-05-17 21:39:29] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, 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}]], initial=1, aps=[p1:(AND (EQ s452 0) (EQ s387 0) (EQ s448 0) (EQ s460 0) (EQ s395 0) (EQ s456 0) (EQ s468 0) (EQ s464 0) (EQ s415 0) (EQ s476 0) (EQ s472 0) (EQ s423 0) (E...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 3 ms.
FORMULA Philosophers-PT-000100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-01 finished in 1187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(X(G(G(p0)))))||F(X(p1)))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:29] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 21:39:30] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:30] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 21:39:30] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:30] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 21:39:30] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (EQ s171 0) (EQ s280 0)) (OR (EQ s184 0) (EQ s259 0)) (OR (EQ s112 0) (EQ s209 0)) (OR (EQ s103 0) (EQ s217 0)) (OR (EQ s133 0) (EQ s231 0)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 212 reset in 1264 ms.
Stack based approach found an accepted trace after 402 steps with 1 reset with depth 156 and stack size 156 in 6 ms.
FORMULA Philosophers-PT-000100-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-03 finished in 2139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 29 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:32] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 21:39:32] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:32] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 21:39:32] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2022-05-17 21:39:32] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:32] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 21:39:32] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-05 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:(AND (OR (NEQ s130 1) (NEQ s319 1)) (OR (NEQ s125 1) (NEQ s322 1)) (OR (NEQ s151 1) (NEQ s329 1)) (OR (NEQ s121 1) (NEQ s335 1)) (OR (NEQ s204 1) (NEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 192 reset in 998 ms.
Stack based approach found an accepted trace after 2268 steps with 2 reset with depth 287 and stack size 287 in 21 ms.
FORMULA Philosophers-PT-000100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-05 finished in 1961 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0)))&&(!p1 U G(p1))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 22 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:34] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-17 21:39:34] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:34] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:34] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2022-05-17 21:39:34] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:34] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:34] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (EQ s44 0) (EQ s150 0)) (OR (EQ s65 0) (EQ s172 0)) (OR (EQ s38 0) (EQ s131 0)) (OR (EQ s0 0) (EQ s94 0)) (OR (EQ s11 0) (EQ s114 0)) (OR (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1308 steps with 1 reset in 18 ms.
FORMULA Philosophers-PT-000100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-06 finished in 1006 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(p0)))&&F(X(G(p0)))&&(p0 U X(p0))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:35] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:35] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:35] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:35] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:35] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:35] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s171 1) (EQ s280 1)) (AND (EQ s184 1) (EQ s259 1)) (AND (EQ s112 1) (EQ s209 1)) (AND (EQ s103 1) (EQ s217 1)) (AND (EQ s133 1) (EQ s231 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8589 steps with 1 reset in 71 ms.
FORMULA Philosophers-PT-000100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-07 finished in 1073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((G(F(p0))||G(p1)||p2) U X(p1))))'
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:36] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 21:39:36] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:36] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:36] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:36] [INFO ] Computed 200 place invariants in 6 ms
[2022-05-17 21:39:37] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 264 ms :[p1, p1, p1, (AND p1 p0), true, (AND p1 p0), p0]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}, { cond=p0, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s126 1) (EQ s323 1)), p1:(AND (EQ s154 1) (EQ s244 1)), p0:(AND (EQ s23 1) (EQ s117 1) (EQ s126 1) (EQ s323 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 668 steps with 165 reset in 19 ms.
FORMULA Philosophers-PT-000100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-08 finished in 1228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p1))&&(F(p2)||p3)&&p0))))'
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:37] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:37] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:37] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 21:39:38] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:38] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 21:39:38] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s174 1) (EQ s412 1)), p1:(AND (EQ s120 1) (EQ s236 1)), p3:(AND (EQ s98 1) (EQ s199 1)), p2:(AND (EQ s174 1) (EQ s412 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-09 finished in 1150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((!p0 U X(!X(p1))) U !G(p0))) U X(p1)))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:38] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:38] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:38] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:39] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:39] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 21:39:39] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), p0, p0]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s39 1) (EQ s130 1)), p0:(AND (EQ s28 1) (EQ s133 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][false, false, false, false]]
Product exploration explored 100000 steps with 35102 reset in 1608 ms.
Stack based approach found an accepted trace after 56756 steps with 20393 reset with depth 24 and stack size 24 in 967 ms.
FORMULA Philosophers-PT-000100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-10 finished in 3746 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 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 402 transition count 402
Applied a total of 196 rules in 52 ms. Remains 402 /500 variables (removed 98) and now considering 402/500 (removed 98) transitions.
// Phase 1: matrix 402 rows 402 cols
[2022-05-17 21:39:42] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 21:39:42] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 402 rows 402 cols
[2022-05-17 21:39:42] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 21:39:42] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2022-05-17 21:39:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 402 rows 402 cols
[2022-05-17 21:39:42] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 21:39:43] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/500 places, 402/500 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/500 places, 402/500 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s105 1) (NEQ s287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13 reset in 530 ms.
Stack based approach found an accepted trace after 573 steps with 0 reset with depth 574 and stack size 563 in 7 ms.
FORMULA Philosophers-PT-000100-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-11 finished in 1704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||X(p1)))||F((!G(p2) U X(p3)))))'
Support contains 5 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:43] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 21:39:44] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:44] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-17 21:39:44] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:44] [INFO ] Computed 200 place invariants in 5 ms
[2022-05-17 21:39:44] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p0)), (NOT p3)]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s157 0) (EQ s350 0)), p3:(EQ s452 1), p1:(OR (EQ s33 0) (EQ s128 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 33094 steps with 31 reset in 189 ms.
FORMULA Philosophers-PT-000100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-13 finished in 1362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||G(p1)))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:45] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:45] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:45] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 21:39:46] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:46] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 21:39:46] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s133 0) (EQ s231 0)), p1:(EQ s426 0)], 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]]
Product exploration explored 100000 steps with 28312 reset in 1909 ms.
Product exploration explored 100000 steps with 28258 reset in 1978 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 p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6647 steps, including 1 resets, run visited all 3 properties in 59 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:51] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 21:39:51] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:51] [INFO ] Computed 200 place invariants in 11 ms
[2022-05-17 21:39:52] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:52] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 21:39:52] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3632 steps, including 1 resets, run visited all 3 properties in 31 ms. (steps per millisecond=117 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 28232 reset in 1900 ms.
Product exploration explored 100000 steps with 27780 reset in 1976 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 0 with 97 rules applied. Total rules applied 97 place count 500 transition count 500
Deduced a syphon composed of 97 places in 0 ms
Applied a total of 97 rules in 56 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2022-05-17 21:39:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 21:39:57] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 21:39:58] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 500/500 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Product exploration explored 100000 steps with 27858 reset in 3234 ms.
Stack based approach found an accepted trace after 33040 steps with 9209 reset with depth 92 and stack size 90 in 1104 ms.
FORMULA Philosophers-PT-000100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLFireability-14 finished in 17103 ms.
All properties solved by simple procedures.
Total runtime 37435 ms.

BK_STOP 1652823602514

--------------------
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-000100"
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-000100, 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-165277016500316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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