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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 434K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 638K 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 23K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 25 08:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 25 08:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K 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 216K 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-000050-00
FORMULA_NAME Philosophers-PT-000050-01
FORMULA_NAME Philosophers-PT-000050-02
FORMULA_NAME Philosophers-PT-000050-03
FORMULA_NAME Philosophers-PT-000050-04
FORMULA_NAME Philosophers-PT-000050-05
FORMULA_NAME Philosophers-PT-000050-06
FORMULA_NAME Philosophers-PT-000050-07
FORMULA_NAME Philosophers-PT-000050-08
FORMULA_NAME Philosophers-PT-000050-09
FORMULA_NAME Philosophers-PT-000050-10
FORMULA_NAME Philosophers-PT-000050-11
FORMULA_NAME Philosophers-PT-000050-12
FORMULA_NAME Philosophers-PT-000050-13
FORMULA_NAME Philosophers-PT-000050-14
FORMULA_NAME Philosophers-PT-000050-15

=== Now, execution of the tool begins

BK_START 1622990119802

Running Version 0
[2021-06-06 14:35:21] [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 14:35:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:35:21] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-06-06 14:35:21] [INFO ] Transformed 250 places.
[2021-06-06 14:35:21] [INFO ] Transformed 250 transitions.
[2021-06-06 14:35:21] [INFO ] Found NUPN structural information;
[2021-06-06 14:35:21] [INFO ] Parsed PT model containing 250 places and 250 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 14:35:21] [INFO ] Initial state test concluded for 3 properties.
FORMULA Philosophers-PT-000050-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 28 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:21] [INFO ] Computed 100 place invariants in 22 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:22] [INFO ] Computed 100 place invariants in 10 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:22] [INFO ] Computed 100 place invariants in 3 ms
[2021-06-06 14:35:22] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
[2021-06-06 14:35:22] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-06 14:35:22] [INFO ] Flatten gal took : 58 ms
FORMULA Philosophers-PT-000050-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 14:35:22] [INFO ] Flatten gal took : 22 ms
[2021-06-06 14:35:22] [INFO ] Input system was already deterministic with 250 transitions.
Incomplete random walk after 100000 steps, including 28 resets, run finished after 459 ms. (steps per millisecond=217 ) properties (out of 12) seen :11
Running SMT prover for 1 properties.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:23] [INFO ] Computed 100 place invariants in 6 ms
[2021-06-06 14:35:23] [INFO ] [Real]Absence check using 100 positive place invariants in 19 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||(X(F((p1&&X(p2))))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:23] [INFO ] Computed 100 place invariants in 6 ms
[2021-06-06 14:35:23] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:23] [INFO ] Computed 100 place invariants in 3 ms
[2021-06-06 14:35:23] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:23] [INFO ] Computed 100 place invariants in 7 ms
[2021-06-06 14:35:24] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 2 (ADD s142 s143 s144 s145 s146 s147 s148 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s193 s194 s196 s197 s198 s199 s200 s201 s202 s203 s204)), p1:(LEQ 1 (ADD s142 s143 s144 s145 s146 s147 s148 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s193 s194 s196 s197 s198 s199 s200 s201 s202 s203 s204)), p2:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s52))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19388 reset in 1280 ms.
Stack based approach found an accepted trace after 6045 steps with 1183 reset with depth 5 and stack size 5 in 75 ms.
FORMULA Philosophers-PT-000050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-00 finished in 2298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||G((F(p1)&&F(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:25] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:25] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:25] [INFO ] Computed 100 place invariants in 10 ms
[2021-06-06 14:35:25] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:26] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000050-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s94 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s149 s150 s151 s152 s153 s154 s155 s156)), p1:(GT (ADD s49 s50 s51 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s95 s96 s97 s98 s99 s100) (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249)), p2:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s52) (ADD s142 s143 s144 s145 s146 s147 s148 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s193 s194 s196 s197 s198 s199 s200 s201 s202 s203 s204))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12620 steps with 0 reset in 77 ms.
FORMULA Philosophers-PT-000050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-01 finished in 666 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:26] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:26] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:26] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-PT-000050-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s94 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s149 s150 s151 s152 s153 s154 s155 s156) (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-02 finished in 526 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F((p1||X((G(p2) U (p1&&G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 50 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:27] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:27] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:27] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:27] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:27] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000050-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s94 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s149 s150 s151 s152 s153 s154 s155 s156)), p1:(LEQ 1 (ADD s94 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s149 s150 s151 s152 s153 s154 s155 s156))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1373 steps with 0 reset in 14 ms.
FORMULA Philosophers-PT-000050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-03 finished in 686 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:27] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:27] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:27] [INFO ] Computed 100 place invariants in 3 ms
[2021-06-06 14:35:27] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2021-06-06 14:35:27] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:27] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:28] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-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 (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s52))], 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 199 reset in 501 ms.
Stuttering criterion allowed to conclude after 68391 steps with 157 reset in 413 ms.
FORMULA Philosophers-PT-000050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-04 finished in 1448 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(p0&&(!p0 U X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:29] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:29] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:29] [INFO ] Computed 100 place invariants in 0 ms
[2021-06-06 14:35:29] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:29] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:29] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000050-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: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s52)), p1:(GT (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s52))], 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 2055 steps with 1 reset in 17 ms.
FORMULA Philosophers-PT-000050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-05 finished in 620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G((F(!p1)&&F(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:29] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:29] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:29] [INFO ] Computed 100 place invariants in 4 ms
[2021-06-06 14:35:30] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2021-06-06 14:35:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:30] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:30] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), p1, p1, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s52)), p1:(LEQ 1 (ADD s142 s143 s144 s145 s146 s147 s148 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s193 s194 s196 s197 s198 s199 s200 s201 s202 s203 s204))], 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 12597 steps with 4 reset in 59 ms.
FORMULA Philosophers-PT-000050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-07 finished in 711 ms.
All properties solved without resorting to model-checking.

BK_STOP 1622990131441

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

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