Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162298995900109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 r140-tall-162298995900109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 198K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.5K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 44K May 5 16:51 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-00
FORMULA_NAME Philosophers-PT-000010-01
FORMULA_NAME Philosophers-PT-000010-02
FORMULA_NAME Philosophers-PT-000010-03
FORMULA_NAME Philosophers-PT-000010-04
FORMULA_NAME Philosophers-PT-000010-05
FORMULA_NAME Philosophers-PT-000010-06
FORMULA_NAME Philosophers-PT-000010-07
FORMULA_NAME Philosophers-PT-000010-08
FORMULA_NAME Philosophers-PT-000010-09
FORMULA_NAME Philosophers-PT-000010-10
FORMULA_NAME Philosophers-PT-000010-11
FORMULA_NAME Philosophers-PT-000010-12
FORMULA_NAME Philosophers-PT-000010-13
FORMULA_NAME Philosophers-PT-000010-14
FORMULA_NAME Philosophers-PT-000010-15

=== Now, execution of the tool begins

BK_START 1623004706413

Running Version 0
[2021-06-06 18:38:27] [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]
[2021-06-06 18:38:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 18:38:28] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-06-06 18:38:28] [INFO ] Transformed 50 places.
[2021-06-06 18:38:28] [INFO ] Transformed 50 transitions.
[2021-06-06 18:38:28] [INFO ] Found NUPN structural information;
[2021-06-06 18:38:28] [INFO ] Parsed PT model containing 50 places and 50 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 18:38:28] [INFO ] Initial state test concluded for 2 properties.
FORMULA Philosophers-PT-000010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 15 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:28] [INFO ] Computed 20 place invariants in 9 ms
[2021-06-06 18:38:28] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:28] [INFO ] Computed 20 place invariants in 5 ms
[2021-06-06 18:38:28] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:28] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
[2021-06-06 18:38:28] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-06-06 18:38:28] [INFO ] Flatten gal took : 26 ms
FORMULA Philosophers-PT-000010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 18:38:28] [INFO ] Flatten gal took : 9 ms
[2021-06-06 18:38:28] [INFO ] Input system was already deterministic with 50 transitions.
Incomplete random walk after 100000 steps, including 715 resets, run finished after 316 ms. (steps per millisecond=316 ) properties (out of 23) seen :22
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:29] [INFO ] Computed 20 place invariants in 4 ms
[2021-06-06 18:38:29] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2021-06-06 18:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 18:38:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-06-06 18:38:29] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (G(p0)||(p0&&G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:30] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:30] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:30] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:30] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2021-06-06 18:38:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:31] [INFO ] Computed 20 place invariants in 5 ms
[2021-06-06 18:38:31] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 1364 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000010-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (NEQ s49 1) (NEQ s48 1) (NEQ s38 1) (NEQ s41 1) (NEQ s43 1) (NEQ s42 1) (NEQ s45 1) (NEQ s44 1) (NEQ s47 1) (NEQ s46 1)) (AND (OR (NEQ s15 1) (NEQ s25 1)) (OR (NEQ s11 1) (NEQ s22 1)) (OR (NEQ s13 1) (NEQ s23 1)) (OR (NEQ s17 1) (NEQ s27 1)) (OR (NEQ s14 1) (NEQ s24 1)) (OR (NEQ s20 1) (NEQ s31 1)) (OR (NEQ s16 1) (NEQ s26 1)) (OR (NEQ s18 1) (NEQ s28 1)) (OR (NEQ s10 1) (NEQ s19 1)) (OR (NEQ s12 1) (NEQ s21 1)))), p0:(OR (NEQ s49 0) (NEQ s48 0) (NEQ s38 0) (NEQ s41 0) (NEQ s43 0) (NEQ s42 0) (NEQ s45 0) (NEQ s44 0) (NEQ s47 0) (NEQ s46 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1989 steps with 13 reset in 37 ms.
FORMULA Philosophers-PT-000010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-01 finished in 1659 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:38:32] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:32] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:32] [INFO ] Computed 20 place invariants in 8 ms
[2021-06-06 18:38:32] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2021-06-06 18:38:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:32] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000010-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (NEQ s3 1) (NEQ s12 1)) (OR (NEQ s0 1) (NEQ s20 1)) (OR (NEQ s1 1) (NEQ s10 1)) (OR (NEQ s5 1) (NEQ s13 1)) (OR (NEQ s2 1) (NEQ s11 1)) (OR (NEQ s6 1) (NEQ s16 1)) (OR (NEQ s8 1) (NEQ s18 1)) (OR (NEQ s9 1) (NEQ s17 1)) (OR (NEQ s7 1) (NEQ s15 1)) (OR (NEQ s4 1) (NEQ s14 1))), p0:(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 (EQ s11 1) (EQ s30 1)) (AND (EQ s14 1) (EQ s36 1)) (AND (EQ s18 1) (EQ s40 1)) (AND (EQ s20 1) (EQ s32 1)) (AND (EQ s15 1) (EQ s39 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 28888 reset in 313 ms.
Stack based approach found an accepted trace after 19 steps with 7 reset with depth 3 and stack size 3 in 1 ms.
FORMULA Philosophers-PT-000010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-02 finished in 467 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:32] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:32] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:33] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2021-06-06 18:38:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:33] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-03 automaton TGBA [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 s12 1) (NEQ s35 1)) (OR (NEQ s13 1) (NEQ s33 1)) (OR (NEQ s17 1) (NEQ s37 1)) (OR (NEQ s10 1) (NEQ s29 1)) (OR (NEQ s16 1) (NEQ s34 1)) (OR (NEQ s11 1) (NEQ s30 1)) (OR (NEQ s14 1) (NEQ s36 1)) (OR (NEQ s18 1) (NEQ s40 1)) (OR (NEQ s20 1) (NEQ s32 1)) (OR (NEQ s15 1) (NEQ s39 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8227 reset in 304 ms.
Stack based approach found an accepted trace after 87 steps with 5 reset with depth 23 and stack size 23 in 1 ms.
FORMULA Philosophers-PT-000010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-03 finished in 619 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((!p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:33] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:33] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (NEQ s3 1) (NEQ s12 1)) (OR (NEQ s0 1) (NEQ s20 1)) (OR (NEQ s1 1) (NEQ s10 1)) (OR (NEQ s5 1) (NEQ s13 1)) (OR (NEQ s2 1) (NEQ s11 1)) (OR (NEQ s6 1) (NEQ s16 1)) (OR (NEQ s8 1) (NEQ s18 1)) (OR (NEQ s9 1) (NEQ s17 1)) (OR (NEQ s7 1) (NEQ s15 1)) (OR (NEQ s4 1) (NEQ s14 1))), p1:(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 (EQ s20 1) (EQ s31 1)) (AND (EQ s16 1) (EQ s26 1)) (AND (EQ s18 1) (EQ s28 1)) (AND (EQ s10 1) (EQ s19 1)) (AND (EQ s12 1) (EQ s21 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 457 steps with 111 reset in 1 ms.
FORMULA Philosophers-PT-000010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-04 finished in 232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:33] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:33] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2021-06-06 18:38:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:33] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(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 1) (EQ s10 1)) (AND (EQ s6 1) (EQ s15 1)) (AND (EQ s8 1) (EQ s17 1)) (AND (EQ s1 1) (EQ s11 1)) (AND (EQ s2 1) (EQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-05 finished in 156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((F((X(p1)||(p2 U (p3||G(p2)))))&&p0)||G(F((p1||(p2 U (p3||G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:33] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:33] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:34] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:34] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:34] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000010-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (NEQ s15 1) (NEQ s25 1)) (OR (NEQ s11 1) (NEQ s22 1)) (OR (NEQ s13 1) (NEQ s23 1)) (OR (NEQ s17 1) (NEQ s27 1)) (OR (NEQ s14 1) (NEQ s24 1)) (OR (NEQ s20 1) (NEQ s31 1)) (OR (NEQ s16 1) (NEQ s26 1)) (OR (NEQ s18 1) (NEQ s28 1)) (OR (NEQ s10 1) (NEQ s19 1)) (OR (NEQ s12 1) (NEQ s21 1))), p1:(AND (OR (NEQ s12 1) (NEQ s35 1)) (OR (NEQ s13 1) (NEQ s33 1)) (OR (NEQ s17 1) (NEQ s37 1)) (OR (NEQ s10 1) (NEQ s29 1)) (OR (NEQ s16 1) (NEQ s34 1)) (OR (NEQ s11 1) (NEQ s30 1)) (OR (NEQ s14 1) (NEQ s36 1)) (OR (NEQ s18 1) (NEQ s40 1)) (OR (NEQ s20 1) (NEQ s32 1)) (OR (NEQ s15 1) (NEQ s39 1))), p3:(AND (OR (NEQ s3 1) (NEQ s12 1)) (OR (NEQ s0 1) (NEQ s20 1)) (OR (NEQ s1 1) (NEQ s10 1)) (OR (NEQ s5 1) (NEQ s13 1)) (OR (NEQ s2 1) (NEQ s11 1)) (OR (NEQ s6 1) (NEQ s16 1)) (OR (NEQ s8 1) (NEQ s18 1)) (OR (NEQ s9 1) (NEQ s17 1)) (OR (NEQ s7 1) (NEQ s15 1)) (OR (NEQ s4 1) (NEQ s14 1)) (OR (NEQ s12 1) (NEQ s35 1)) (OR (NEQ s13 1) (NEQ s33 1)) (OR (NEQ s17 1) (NEQ s37 1)) (OR (NEQ s10 1) (NEQ s29 1)) (OR (NEQ s16 1) (NEQ s34 1)) (OR (NEQ s11 1) (NEQ s30 1)) (OR (NEQ s14 1) (NEQ s36 1)) (OR (NEQ s18 1) (NEQ s40 1)) (OR (NEQ s20 1) (NEQ s32 1)) (OR (NEQ s15 1) (NEQ s39 1))), p2:(AND (OR (NEQ s3 1) (NEQ s12 1)) (OR (NEQ s0 1) (NEQ s20 1)) (OR (NEQ s1 1) (NEQ s10 1)) (OR (NEQ s5 1) (NEQ s13 1)) (OR (NEQ s2 1) (NEQ s11 1)) (OR (NEQ s6 1) (NEQ s16 1)) (OR (NEQ s8 1) (NEQ s18 1)) (OR (NEQ s9 1) (NEQ s17 1)) (OR (NEQ s7 1) (NEQ s15 1)) (OR (NEQ s4 1) (NEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15231 reset in 334 ms.
Stack based approach found an accepted trace after 316 steps with 48 reset with depth 11 and stack size 11 in 3 ms.
FORMULA Philosophers-PT-000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-07 finished in 542 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((p1&&G(p2)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:38:34] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:34] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:34] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:34] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 1465 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000010-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s5 0) (EQ s16 0)) (OR (EQ s6 0) (EQ s16 0))), p1:(EQ s44 1), p2:(AND (EQ s1 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 322 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-08 finished in 1584 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:36] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:36] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s7 1) (EQ s15 1)), p1:(NEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-09 finished in 283 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 43 transition count 43
Applied a total of 14 rules in 18 ms. Remains 43 /50 variables (removed 7) and now considering 43/50 (removed 7) transitions.
// Phase 1: matrix 43 rows 43 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:36] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 43 rows 43 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:36] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2021-06-06 18:38:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 43 rows 43 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 6 ms
[2021-06-06 18:38:36] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/50 places, 43/50 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000010-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s11 1) (EQ s30 1)), p0:(AND (EQ s0 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-11 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions, 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 4 ms. Remains 42 /50 variables (removed 8) and now considering 42/50 (removed 8) transitions.
// Phase 1: matrix 42 rows 42 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:36] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:36] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2021-06-06 18:38:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 3 ms
[2021-06-06 18:38:36] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/50 places, 42/50 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000010-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (NEQ s20 1) (NEQ s32 1)), p0:(OR (NEQ s9 1) (NEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15876 reset in 202 ms.
Stack based approach found an accepted trace after 11 steps with 3 reset with depth 2 and stack size 2 in 0 ms.
FORMULA Philosophers-PT-000010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-12 finished in 372 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(((p0 U G(p1))||G(p2)))&&F(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions, 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 0 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 4 ms. Remains 45 /50 variables (removed 5) and now considering 45/50 (removed 5) transitions.
// Phase 1: matrix 45 rows 45 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:36] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 45 rows 45 cols
[2021-06-06 18:38:36] [INFO ] Computed 20 place invariants in 5 ms
[2021-06-06 18:38:37] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2021-06-06 18:38:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 45 cols
[2021-06-06 18:38:37] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:37] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/50 places, 45/50 transitions.
Stuttering acceptance computed with spot in 877 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s16 1)), p1:(AND (EQ s5 1) (EQ s13 1) (EQ s17 1) (EQ s37 1)), p2:(OR (EQ s5 0) (EQ s13 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 794 reset in 168 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 47 in 0 ms.
FORMULA Philosophers-PT-000010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-14 finished in 1175 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(p1)&&X(G(!p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-06-06 18:38:38] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:38] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:38] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:38] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:38] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 108 ms :[p1, true, (OR (NOT p0) p1), true]
Running random walk in product with property : Philosophers-PT-000010-15 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s8 1) (EQ s17 1)), p0:(OR (EQ s15 0) (EQ s39 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-15 finished in 230 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623004727114

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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 r140-tall-162298995900109"
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 ;