Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016600371.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016600371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.9K Apr 30 07:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 07:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 31K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652834765776

Running Version 202205111006
[2022-05-18 00:46:07] [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]
[2022-05-18 00:46:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:46:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-18 00:46:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 00:46:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 648 ms
[2022-05-18 00:46:07] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA PhilosophersDyn-COL-03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 00:46:07] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 6 ms.
[2022-05-18 00:46:07] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 1362 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10000 steps, including 258 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 552 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 745 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7 rows 8 cols
[2022-05-18 00:46:08] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-18 00:46:08] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2022-05-18 00:46:08] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-18 00:46:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 00:46:09] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-18 00:46:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-18 00:46:09] [INFO ] After 14ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-18 00:46:09] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-18 00:46:09] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-18 00:46:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-18 00:46:09] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 7/7 transitions.
Incomplete random walk after 10001 steps, including 1358 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 260 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 550 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Probably explored full state space saw : 42 states, properties seen :0
Probabilistic random walk after 118 steps, saw 42 distinct states, run finished after 10 ms. (steps per millisecond=11 ) properties seen :0
Explored full state space saw : 42 states, properties seen :0
Exhaustive walk after 118 steps, saw 42 distinct states, run finished after 2 ms. (steps per millisecond=59 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 00:46:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-18 00:46:09] [INFO ] Flatten gal took : 18 ms
FORMULA PhilosophersDyn-COL-03-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 00:46:09] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2022-05-18 00:46:09] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 22 ms.
[2022-05-18 00:46:09] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2022-05-18 00:46:09] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-18 00:46:09] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:09] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:09] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:09] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:09] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-18 00:46:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2022-05-18 00:46:09] [INFO ] Flatten gal took : 11 ms
[2022-05-18 00:46:09] [INFO ] Flatten gal took : 10 ms
[2022-05-18 00:46:09] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 237 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 351 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 00:46:10] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-18 00:46:10] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:46:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 00:46:10] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-18 00:46:10] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:46:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:10] [INFO ] After 20ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:46:10] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-18 00:46:10] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:10] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 240 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 351 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Probably explored full state space saw : 325 states, properties seen :0
Probabilistic random walk after 1090 steps, saw 325 distinct states, run finished after 28 ms. (steps per millisecond=38 ) properties seen :0
Explored full state space saw : 325 states, properties seen :0
Exhaustive walk after 1090 steps, saw 325 distinct states, run finished after 8 ms. (steps per millisecond=136 ) properties seen :0
FORMULA PhilosophersDyn-COL-03-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:10] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:10] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:10] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:10] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:10] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-05-18 00:46:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:11] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s21 s22 s23) (ADD s18 s19 s20))], 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 7 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-02 finished in 557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:11] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:11] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:11] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-18 00:46:11] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:11] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:11] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:11] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s24 s25 s26) (ADD s21 s22 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-05 finished in 896 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:12] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-18 00:46:12] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2022-05-18 00:46:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:12] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s24 s25 s26))], 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 16 steps with 2 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-06 finished in 332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&p1))&&F(G((G(p2)&&p3)))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:12] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:12] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:12] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-18 00:46:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p3)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 p2), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s9 s10 s11) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8)), p1:(LEQ 2 (ADD s21 s22 s23)), p3:(GT 2 (ADD s15 s16 s17)), p2:(OR (GT (ADD s18 s19 s20) (ADD s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 29 steps with 3 reset in 2 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-08 finished in 438 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||G(G(F(p1)))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:12] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:12] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:12] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:12] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:13] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:13] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:13] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 (ADD s12 s13 s14)), p1:(GT (ADD s15 s16 s17) (ADD s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-09 finished in 885 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:13] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:13] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:13] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:46:13] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:13] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:13] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2022-05-18 00:46:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:13] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:46:13] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s9 s10 s11))], 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 6 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-12 finished in 261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((F(p0)||p1))&&p2))))'
Support contains 12 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:14] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:14] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:14] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:46:14] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:46:14] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:46:14] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ (ADD s9 s10 s11) (ADD s21 s22 s23)), p0:(LEQ 1 (ADD s24 s25 s26)), p1:(LEQ 3 (ADD s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-13 finished in 398 ms.
All properties solved by simple procedures.
Total runtime 7341 ms.

BK_STOP 1652834774471

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-03"
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 PhilosophersDyn-COL-03, 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 r168-tall-165277016600371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 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 ;