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.r078-tall-165260110400491.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 Eratosthenes-PT-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110400491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.4K Apr 29 16:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 16:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 15:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 311K May 10 09:33 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 Eratosthenes-PT-200-LTLCardinality-00
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-01
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-02
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-03
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-04
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-05
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-06
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-07
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-08
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-09
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-10
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-11
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-12
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-13
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-14
FORMULA_NAME Eratosthenes-PT-200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652686249687

Running Version 202205111006
[2022-05-16 07:30:50] [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-16 07:30:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:30:51] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-05-16 07:30:51] [INFO ] Transformed 199 places.
[2022-05-16 07:30:51] [INFO ] Transformed 699 transitions.
[2022-05-16 07:30:51] [INFO ] Parsed PT model containing 199 places and 699 transitions in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA Eratosthenes-PT-200-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 529/529 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 130 transition count 506
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 130 transition count 506
Drop transitions removed 376 transitions
Redundant transition composition rules discarded 376 transitions
Iterating global reduction 0 with 376 rules applied. Total rules applied 422 place count 130 transition count 130
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 521 place count 31 transition count 31
Iterating global reduction 0 with 99 rules applied. Total rules applied 620 place count 31 transition count 31
Applied a total of 620 rules in 40 ms. Remains 31 /153 variables (removed 122) and now considering 31/529 (removed 498) transitions.
// Phase 1: matrix 31 rows 31 cols
[2022-05-16 07:30:51] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 07:30:51] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2022-05-16 07:30:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:51] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 31 cols
[2022-05-16 07:30:51] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:51] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/153 places, 31/529 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/153 places, 31/529 transitions.
Support contains 30 out of 31 places after structural reductions.
[2022-05-16 07:30:51] [INFO ] Flatten gal took : 17 ms
[2022-05-16 07:30:51] [INFO ] Flatten gal took : 4 ms
[2022-05-16 07:30:51] [INFO ] Input system was already deterministic with 31 transitions.
Incomplete random walk after 10052 steps, including 64 resets, run finished after 159 ms. (steps per millisecond=63 ) properties (out of 24) seen :16
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 31 rows 31 cols
[2022-05-16 07:30:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:52] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2022-05-16 07:30:52] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA Eratosthenes-PT-200-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 31
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Eratosthenes-PT-200-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&p1)))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 4 transition count 4
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 4 transition count 4
Applied a total of 54 rules in 0 ms. Remains 4 /31 variables (removed 27) and now considering 4/31 (removed 27) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:52] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:52] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:30:52] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:52] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/31 places, 4/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/31 places, 4/31 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (LEQ 1 s1) (LEQ 1 s2)), p1:(LEQ 1 s3)], 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, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 5 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-01 finished in 380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Graph (complete) has 0 edges and 31 vertex of which 2 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.3 ms
Discarding 29 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Applied a total of 1 rules in 5 ms. Remains 2 /31 variables (removed 29) and now considering 2/31 (removed 29) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:52] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:52] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2022-05-16 07:30:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:53] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/31 places, 2/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/31 places, 2/31 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s0 s1)], 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 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-05 finished in 110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Graph (complete) has 0 edges and 31 vertex of which 2 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /31 variables (removed 29) and now considering 2/31 (removed 29) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:53] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-16 07:30:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:53] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/31 places, 2/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/31 places, 2/31 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-06 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 s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 129 ms.
Product exploration explored 100000 steps with 33333 reset in 91 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-200-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLCardinality-06 finished in 528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((G(!(F(p0) U X(p0)))||G(p0))))))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2 transition count 2
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2 transition count 2
Applied a total of 58 rules in 2 ms. Remains 2 /31 variables (removed 29) and now considering 2/31 (removed 29) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:53] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:53] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:30:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:53] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/31 places, 2/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/31 places, 2/31 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, p0, (NOT p0), false, false, false]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=3, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-09 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||G(p1))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Graph (complete) has 0 edges and 31 vertex of which 3 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /31 variables (removed 28) and now considering 3/31 (removed 28) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:53] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:53] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-16 07:30:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:53] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:53] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/31 places, 3/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/31 places, 3/31 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 1 s0), p0:(OR (AND (LEQ s1 1) (LEQ 3 s2)) (LEQ 1 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-10 finished in 177 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3 transition count 3
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3 transition count 3
Applied a total of 56 rules in 1 ms. Remains 3 /31 variables (removed 28) and now considering 3/31 (removed 28) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:54] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:54] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/31 places, 3/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/31 places, 3/31 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-12 automaton TGBA Formula[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 s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-12 finished in 161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(((F(p0)||X(p1))&&p1)))||X(p1)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 5 transition count 5
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 5 transition count 5
Applied a total of 52 rules in 1 ms. Remains 5 /31 variables (removed 26) and now considering 5/31 (removed 26) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:30:54] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-16 07:30:54] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:30:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:30:54] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:30:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/31 places, 5/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/31 places, 5/31 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s4 s2), p0:(LEQ s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, 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 4 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-13 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(X(G(X(p1))))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3 transition count 3
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3 transition count 3
Applied a total of 56 rules in 1 ms. Remains 3 /31 variables (removed 28) and now considering 3/31 (removed 28) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:54] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:54] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:30:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:30:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/31 places, 3/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/31 places, 3/31 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s2), p1:(LEQ 1 s1)], 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28483 reset in 145 ms.
Product exploration explored 100000 steps with 28462 reset in 92 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-200-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLCardinality-15 finished in 675 ms.
All properties solved by simple procedures.
Total runtime 4335 ms.

BK_STOP 1652686255530

--------------------
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="Eratosthenes-PT-200"
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 Eratosthenes-PT-200, 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 r078-tall-165260110400491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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