Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850000171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r165-tall-167838850000171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 311K Mar 5 18:22 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 1679445130744

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-200
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 00:32:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 00:32:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:32:13] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-22 00:32:13] [INFO ] Transformed 199 places.
[2023-03-22 00:32:13] [INFO ] Transformed 699 transitions.
[2023-03-22 00:32:13] [INFO ] Parsed PT model containing 199 places and 699 transitions and 2097 arcs in 145 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 3 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-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 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 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 519 place count 33 transition count 33
Iterating global reduction 0 with 97 rules applied. Total rules applied 616 place count 33 transition count 33
Applied a total of 616 rules in 25 ms. Remains 33 /153 variables (removed 120) and now considering 33/529 (removed 496) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-03-22 00:32:13] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-22 00:32:14] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-22 00:32:14] [INFO ] Invariant cache hit.
[2023-03-22 00:32:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-22 00:32:14] [INFO ] Invariant cache hit.
[2023-03-22 00:32:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33/153 places, 33/529 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 33/153 places, 33/529 transitions.
Support contains 32 out of 33 places after structural reductions.
[2023-03-22 00:32:14] [INFO ] Flatten gal took : 17 ms
[2023-03-22 00:32:14] [INFO ] Flatten gal took : 4 ms
[2023-03-22 00:32:14] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 10054 steps, including 64 resets, run finished after 152 ms. (steps per millisecond=66 ) properties (out of 22) seen :10
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-22 00:32:14] [INFO ] Invariant cache hit.
[2023-03-22 00:32:15] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 00:32:15] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :0
Fused 12 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA Eratosthenes-PT-200-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-200-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 33 stabilizing places and 33 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33 transition count 33
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-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 0 edges and 33 vertex of which 2 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Applied a total of 1 rules in 3 ms. Remains 2 /33 variables (removed 31) and now considering 2/33 (removed 31) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-22 00:32:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 00:32:15] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 00:32:15] [INFO ] Invariant cache hit.
[2023-03-22 00:32:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 00:32:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:32:15] [INFO ] Invariant cache hit.
[2023-03-22 00:32:15] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/33 places, 2/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 2/33 places, 2/33 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-06 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 3 transition count 3
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 3 transition count 3
Applied a total of 60 rules in 2 ms. Remains 3 /33 variables (removed 30) and now considering 3/33 (removed 30) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-22 00:32:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 00:32:15] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-22 00:32:15] [INFO ] Invariant cache hit.
[2023-03-22 00:32:15] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-22 00:32:15] [INFO ] Invariant cache hit.
[2023-03-22 00:32:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/33 places, 3/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 3/33 places, 3/33 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s1 s2)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 309 steps with 2 reset in 6 ms.
FORMULA Eratosthenes-PT-200-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-200-LTLCardinality-08 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G((p0||F(p1)))) U p2))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 7 transition count 7
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 7 transition count 7
Applied a total of 52 rules in 1 ms. Remains 7 /33 variables (removed 26) and now considering 7/33 (removed 26) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-22 00:32:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 00:32:15] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-22 00:32:15] [INFO ] Invariant cache hit.
[2023-03-22 00:32:15] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-22 00:32:15] [INFO ] Invariant cache hit.
[2023-03-22 00:32:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/33 places, 7/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 7/33 places, 7/33 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-200-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GT s5 s3), p0:(LEQ s4 s2), p1:(LEQ s6 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 764 reset in 136 ms.
Product exploration explored 100000 steps with 770 reset in 101 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
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 p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), true, (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 585 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Finished random walk after 461 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=230 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), true, (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p2)]
Knowledge based reduction with 6 factoid took 578 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2)]
[2023-03-22 00:32:17] [INFO ] Invariant cache hit.
[2023-03-22 00:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:32:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 00:32:17] [INFO ] Solution in real domain found non-integer solution.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), true, (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 6 factoid took 373 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-200-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLCardinality-11 finished in 2574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 0 edges and 33 vertex of which 3 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /33 variables (removed 30) and now considering 3/33 (removed 30) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-22 00:32:18] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 00:32:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 00:32:18] [INFO ] Invariant cache hit.
[2023-03-22 00:32:18] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 00:32:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:32:18] [INFO ] Invariant cache hit.
[2023-03-22 00:32:18] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/33 places, 3/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 3/33 places, 3/33 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-200-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:(AND (LEQ s1 s2) (LEQ s0 1))], 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 25000 reset in 139 ms.
Product exploration explored 100000 steps with 25000 reset in 119 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 : [p0, (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-200-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-200-LTLCardinality-12 finished in 769 ms.
All properties solved by simple procedures.
Total runtime 5511 ms.

BK_STOP 1679445143318

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5348"
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 r165-tall-167838850000171"
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 ;