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-162298996000116.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-000020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298996000116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 65K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 421K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 39K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K 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 12K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 25 08:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 25 08:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K 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 86K 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-000020-00
FORMULA_NAME Philosophers-PT-000020-01
FORMULA_NAME Philosophers-PT-000020-02
FORMULA_NAME Philosophers-PT-000020-03
FORMULA_NAME Philosophers-PT-000020-04
FORMULA_NAME Philosophers-PT-000020-05
FORMULA_NAME Philosophers-PT-000020-06
FORMULA_NAME Philosophers-PT-000020-07
FORMULA_NAME Philosophers-PT-000020-08
FORMULA_NAME Philosophers-PT-000020-09
FORMULA_NAME Philosophers-PT-000020-10
FORMULA_NAME Philosophers-PT-000020-11
FORMULA_NAME Philosophers-PT-000020-12
FORMULA_NAME Philosophers-PT-000020-13
FORMULA_NAME Philosophers-PT-000020-14
FORMULA_NAME Philosophers-PT-000020-15

=== Now, execution of the tool begins

BK_START 1623004762857

Running Version 0
[2021-06-06 18:39:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:39:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 18:39:24] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-06-06 18:39:24] [INFO ] Transformed 100 places.
[2021-06-06 18:39:24] [INFO ] Transformed 100 transitions.
[2021-06-06 18:39:24] [INFO ] Found NUPN structural information;
[2021-06-06 18:39:24] [INFO ] Parsed PT model containing 100 places and 100 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 18:39:24] [INFO ] Initial state test concluded for 5 properties.
FORMULA Philosophers-PT-000020-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:24] [INFO ] Computed 40 place invariants in 13 ms
[2021-06-06 18:39:24] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:24] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 18:39:24] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:24] [INFO ] Computed 40 place invariants in 9 ms
[2021-06-06 18:39:24] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2021-06-06 18:39:25] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-06 18:39:25] [INFO ] Flatten gal took : 30 ms
FORMULA Philosophers-PT-000020-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 18:39:25] [INFO ] Flatten gal took : 12 ms
[2021-06-06 18:39:25] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 519 steps, including 0 resets, run visited all 13 properties in 7 ms. (steps per millisecond=74 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:25] [INFO ] Computed 40 place invariants in 4 ms
[2021-06-06 18:39:25] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:25] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 18:39:25] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2021-06-06 18:39:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:25] [INFO ] Computed 40 place invariants in 5 ms
[2021-06-06 18:39:25] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000020-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s20)), p0:(LEQ (ADD s19 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s39 s40) (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s58 s59 s60))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 811 steps with 5 reset in 15 ms.
FORMULA Philosophers-PT-000020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-01 finished in 473 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 80 transition count 80
Applied a total of 40 rules in 12 ms. Remains 80 /100 variables (removed 20) and now considering 80/100 (removed 20) transitions.
// Phase 1: matrix 80 rows 80 cols
[2021-06-06 18:39:25] [INFO ] Computed 40 place invariants in 4 ms
[2021-06-06 18:39:25] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2021-06-06 18:39:25] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:25] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2021-06-06 18:39:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2021-06-06 18:39:25] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 18:39:25] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/100 places, 80/100 transitions.
Stuttering acceptance computed with spot in 815 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s58 s59 s60))], 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 232 steps with 0 reset in 6 ms.
FORMULA Philosophers-PT-000020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-02 finished in 1065 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:26] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:26] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:26] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:26] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2021-06-06 18:39:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:26] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:26] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-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:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s20) (ADD s57 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s81 s82 s84))], 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 3360 reset in 493 ms.
Stack based approach found an accepted trace after 71 steps with 3 reset with depth 11 and stack size 11 in 0 ms.
FORMULA Philosophers-PT-000020-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-03 finished in 957 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:27] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:27] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:27] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:27] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2021-06-06 18:39:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:27] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 18:39:27] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-04 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:(LEQ (ADD s19 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s39 s40) (ADD s57 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s81 s82 s84))], 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 5126 reset in 433 ms.
Stack based approach found an accepted trace after 300 steps with 12 reset with depth 19 and stack size 19 in 2 ms.
FORMULA Philosophers-PT-000020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-04 finished in 890 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:28] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:28] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:28] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:28] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2021-06-06 18:39:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:28] [INFO ] Computed 40 place invariants in 2 ms
[2021-06-06 18:39:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 310 ms :[true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-06 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:(LEQ (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s58 s59 s60) (ADD s19 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s39 s40))], 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 49 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-06 finished in 525 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1))&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:29] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:29] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:29] [INFO ] Computed 40 place invariants in 8 ms
[2021-06-06 18:39:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2021-06-06 18:39:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:29] [INFO ] Computed 40 place invariants in 3 ms
[2021-06-06 18:39:29] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000020-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s57 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s81 s82 s84)), p1:(GT 1 (ADD s77 s78 s79 s80 s83 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99)), p2:(GT (ADD s57 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s81 s82 s84) (ADD s77 s78 s79 s80 s83 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99))], 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 209 steps with 3 reset in 2 ms.
FORMULA Philosophers-PT-000020-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-07 finished in 333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:29] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:29] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:29] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:29] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:29] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:29] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000020-08 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}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (NEQ s31 0) (NEQ s77 1)), p0:(OR (EQ s1 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 36536 reset in 332 ms.
Stack based approach found an accepted trace after 1124 steps with 435 reset with depth 118 and stack size 118 in 5 ms.
FORMULA Philosophers-PT-000020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-08 finished in 622 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:30] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:30] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:30] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:30] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 18:39:30] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:30] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 39623 reset in 278 ms.
Stack based approach found an accepted trace after 5626 steps with 2223 reset with depth 17 and stack size 17 in 18 ms.
FORMULA Philosophers-PT-000020-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-11 finished in 547 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 100/100 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 82 transition count 82
Applied a total of 36 rules in 12 ms. Remains 82 /100 variables (removed 18) and now considering 82/100 (removed 18) transitions.
// Phase 1: matrix 82 rows 82 cols
[2021-06-06 18:39:30] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:30] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 82 rows 82 cols
[2021-06-06 18:39:30] [INFO ] Computed 40 place invariants in 0 ms
[2021-06-06 18:39:30] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2021-06-06 18:39:30] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 82 rows 82 cols
[2021-06-06 18:39:30] [INFO ] Computed 40 place invariants in 1 ms
[2021-06-06 18:39:30] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/100 places, 82/100 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s30 0) (EQ s65 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 231 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-14 finished in 374 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623004779909

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-000020"
export BK_EXAMINATION="LTLCardinality"
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-000020, examination is LTLCardinality"
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-162298996000116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;