fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r140-tall-162298995900108
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Philosophers-PT-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
242.903 12430.00 13729.00 2111.40 FFFFFFTFFFFFTFTF normal

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

--------------------
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 1623004691285

Running Version 0
[2021-06-06 18:38:13] [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:38:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 18:38:13] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-06-06 18:38:13] [INFO ] Transformed 50 places.
[2021-06-06 18:38:13] [INFO ] Transformed 50 transitions.
[2021-06-06 18:38:13] [INFO ] Found NUPN structural information;
[2021-06-06 18:38:13] [INFO ] Parsed PT model containing 50 places and 50 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 18:38:13] [INFO ] Initial state test concluded for 3 properties.
FORMULA Philosophers-PT-000010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 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 10 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:14] [INFO ] Computed 20 place invariants in 11 ms
[2021-06-06 18:38:14] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:15] [INFO ] Computed 20 place invariants in 7 ms
[2021-06-06 18:38:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:15] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:15] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
[2021-06-06 18:38:15] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-06-06 18:38:15] [INFO ] Flatten gal took : 23 ms
FORMULA Philosophers-PT-000010-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 18:38:15] [INFO ] Flatten gal took : 9 ms
[2021-06-06 18:38:15] [INFO ] Input system was already deterministic with 50 transitions.
Finished random walk after 97 steps, including 1 resets, run visited all 9 properties in 4 ms. (steps per millisecond=24 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||X(p0)))||((p0||X(p0))&&X(X(F(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:15] [INFO ] Computed 20 place invariants in 5 ms
[2021-06-06 18:38:15] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:15] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:15] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:15] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:15] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
[2021-06-06 18:38:15] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 439 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-00 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=3, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s19 s21 s22 s23 s24 s25 s26 s27 s28 s31)), p1:(GT 3 (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 12 ms.
FORMULA Philosophers-PT-000010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-00 finished in 634 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(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 12 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:15] [INFO ] Computed 20 place invariants in 4 ms
[2021-06-06 18:38:16] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:16] [INFO ] Computed 20 place invariants in 6 ms
[2021-06-06 18:38:16] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2021-06-06 18:38:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:16] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000010-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49) (ADD s29 s30 s32 s33 s34 s35 s36 s37 s39 s40)), p1:(GT (ADD s19 s21 s22 s23 s24 s25 s26 s27 s28 s31) (ADD s29 s30 s32 s33 s34 s35 s36 s37 s39 s40))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1039 reset in 345 ms.
Stack based approach found an accepted trace after 12258 steps with 124 reset with depth 71 and stack size 68 in 28 ms.
FORMULA Philosophers-PT-000010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-01 finished in 628 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&F(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:16] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:16] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:16] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:16] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:16] [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 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s19 s21 s22 s23 s24 s25 s26 s27 s28 s31)), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s29 s30 s32 s33 s34 s35 s36 s37 s39 s40))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-03 finished in 334 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 40 transition count 40
Applied a total of 20 rules in 6 ms. Remains 40 /50 variables (removed 10) and now considering 40/50 (removed 10) transitions.
// Phase 1: matrix 40 rows 40 cols
[2021-06-06 18:38:16] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:16] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 40 rows 40 cols
[2021-06-06 18:38:16] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:16] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2021-06-06 18:38:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 40 cols
[2021-06-06 18:38:17] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 18:38:17] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/50 places, 40/50 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-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:(GT 1 (ADD s29 s30 s32 s33 s34 s35 s36 s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 212 steps with 4 reset in 3 ms.
FORMULA Philosophers-PT-000010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-04 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 10 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:17] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:17] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:17] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:17] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49))], 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 2 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 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 10 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:17] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 18:38:17] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:17] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2021-06-06 18:38:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:17] [INFO ] Computed 20 place invariants in 5 ms
[2021-06-06 18:38:17] [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 33 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49))], 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 187 steps with 0 reset in 2 ms.
FORMULA Philosophers-PT-000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-07 finished in 168 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 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:17] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 18:38:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 18:38:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-13 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 s4 0) (EQ s49 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 10698 reset in 221 ms.
Stack based approach found an accepted trace after 81 steps with 9 reset with depth 19 and stack size 19 in 1 ms.
FORMULA Philosophers-PT-000010-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-13 finished in 419 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623004703715

--------------------
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-000010"
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-000010, 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-162298995900108"
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 [ "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 ;