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.r169-tall-167838855500164.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 ltsminxred
Input is Eratosthenes-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855500164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 126K 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-100-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678494848019

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 00:34:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:34:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:34:09] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-11 00:34:09] [INFO ] Transformed 99 places.
[2023-03-11 00:34:09] [INFO ] Transformed 283 transitions.
[2023-03-11 00:34:09] [INFO ] Parsed PT model containing 99 places and 283 transitions and 849 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
FORMULA Eratosthenes-PT-100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 211/211 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 60 transition count 197
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 60 transition count 197
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 165 place count 60 transition count 60
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 193 place count 32 transition count 32
Iterating global reduction 0 with 28 rules applied. Total rules applied 221 place count 32 transition count 32
Applied a total of 221 rules in 17 ms. Remains 32 /74 variables (removed 42) and now considering 32/211 (removed 179) transitions.
// Phase 1: matrix 32 rows 32 cols
[2023-03-11 00:34:10] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-11 00:34:10] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-11 00:34:10] [INFO ] Invariant cache hit.
[2023-03-11 00:34:10] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-11 00:34:10] [INFO ] Invariant cache hit.
[2023-03-11 00:34:10] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/74 places, 32/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 32/74 places, 32/211 transitions.
Support contains 31 out of 32 places after structural reductions.
[2023-03-11 00:34:10] [INFO ] Flatten gal took : 16 ms
[2023-03-11 00:34:10] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:34:10] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 75 steps, including 0 resets, run visited all 29 properties in 15 ms. (steps per millisecond=5 )
Computed a total of 32 stabilizing places and 32 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 32
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(X((p0||G(F((p1||G(p2))))))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 6 transition count 6
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 6 transition count 6
Applied a total of 52 rules in 0 ms. Remains 6 /32 variables (removed 26) and now considering 6/32 (removed 26) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-11 00:34:10] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 00:34:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 00:34:10] [INFO ] Invariant cache hit.
[2023-03-11 00:34:10] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 00:34:10] [INFO ] Invariant cache hit.
[2023-03-11 00:34:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/32 places, 6/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 6/32 places, 6/32 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1)), p2:(AND (GEQ s2 1) (GEQ s4 1)), p1:(AND (GEQ s1 1) (GEQ s3 1))], 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]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 3 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-00 finished in 471 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||(G(F(p2))&&p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 4 transition count 4
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 4 transition count 4
Applied a total of 56 rules in 2 ms. Remains 4 /32 variables (removed 28) and now considering 4/32 (removed 28) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 00:34:11] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 00:34:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 00:34:11] [INFO ] Invariant cache hit.
[2023-03-11 00:34:11] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-11 00:34:11] [INFO ] Invariant cache hit.
[2023-03-11 00:34:11] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/32 places, 4/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 4/32 places, 4/32 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2 1), p1:(AND (GEQ s1 1) (GEQ s3 1)), p2:(AND (GEQ s1 1) (GEQ s3 1))], 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][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-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-01 finished in 404 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 2 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 3 ms. Remains 2 /32 variables (removed 30) and now considering 2/32 (removed 30) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 00:34:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 00:34:11] [INFO ] Invariant cache hit.
[2023-03-11 00:34:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-11 00:34:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:34:11] [INFO ] Invariant cache hit.
[2023-03-11 00:34:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/32 places, 2/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 2/32 places, 2/32 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s0 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 35307 reset in 161 ms.
Product exploration explored 100000 steps with 35309 reset in 97 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 : [(AND (NOT p0) (NOT p1)), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-02 finished in 706 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' '!(((G(X((X(p1) U p2)))&&p0) U X(p3)))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 7 transition count 7
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 7 transition count 7
Applied a total of 50 rules in 2 ms. Remains 7 /32 variables (removed 25) and now considering 7/32 (removed 25) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-11 00:34:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:12] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 00:34:12] [INFO ] Invariant cache hit.
[2023-03-11 00:34:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-11 00:34:12] [INFO ] Invariant cache hit.
[2023-03-11 00:34:12] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/32 places, 7/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 7/32 places, 7/32 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p3), (NOT p3), (NOT p3), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(NOT p3), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s6 1)), p3:(GEQ s2 1), p2:(GEQ s4 1), p1:(AND (GEQ s3 1) (GEQ s5 1))], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-03 finished in 343 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)||F(G(p1)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 4 transition count 4
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 4 transition count 4
Applied a total of 56 rules in 8 ms. Remains 4 /32 variables (removed 28) and now considering 4/32 (removed 28) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 00:34:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:12] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 00:34:12] [INFO ] Invariant cache hit.
[2023-03-11 00:34:12] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-11 00:34:12] [INFO ] Invariant cache hit.
[2023-03-11 00:34:12] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/32 places, 4/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 4/32 places, 4/32 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s1 1), p1:(OR (LT s2 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1333 reset in 100 ms.
Product exploration explored 100000 steps with 1333 reset in 123 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 p0 (NOT p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-04 finished in 668 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 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3 transition count 3
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3 transition count 3
Applied a total of 58 rules in 1 ms. Remains 3 /32 variables (removed 29) and now considering 3/32 (removed 29) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:34:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:13] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 00:34:13] [INFO ] Invariant cache hit.
[2023-03-11 00:34:13] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-11 00:34:13] [INFO ] Invariant cache hit.
[2023-03-11 00:34:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/32 places, 3/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 3/32 places, 3/32 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-05 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:(OR (LT s1 1) (LT s2 1))], 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 76 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-05 finished in 165 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((p0&&G(p1))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3 transition count 3
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3 transition count 3
Applied a total of 58 rules in 1 ms. Remains 3 /32 variables (removed 29) and now considering 3/32 (removed 29) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:34:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 00:34:13] [INFO ] Invariant cache hit.
[2023-03-11 00:34:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-11 00:34:13] [INFO ] Invariant cache hit.
[2023-03-11 00:34:13] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/32 places, 3/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 3/32 places, 3/32 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GEQ s1 1), p0:(GEQ s2 1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-06 finished in 205 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((p0 U X(F(p0))))&&!(F(X(p1)) U !p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 4 transition count 4
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 4 transition count 4
Applied a total of 56 rules in 1 ms. Remains 4 /32 variables (removed 28) and now considering 4/32 (removed 28) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 00:34:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 00:34:13] [INFO ] Invariant cache hit.
[2023-03-11 00:34:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-11 00:34:13] [INFO ] Invariant cache hit.
[2023-03-11 00:34:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/32 places, 4/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 4/32 places, 4/32 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (OR (NOT p0) p1), p1, (AND p1 (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-07 finished in 303 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(X(G(p0))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3 transition count 3
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3 transition count 3
Applied a total of 58 rules in 3 ms. Remains 3 /32 variables (removed 29) and now considering 3/32 (removed 29) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:34:14] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:14] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 00:34:14] [INFO ] Invariant cache hit.
[2023-03-11 00:34:14] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-11 00:34:14] [INFO ] Invariant cache hit.
[2023-03-11 00:34:14] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/32 places, 3/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 3/32 places, 3/32 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-08 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s2 1))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 227 steps with 3 reset in 1 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-08 finished in 229 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(p0))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 1 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /32 variables (removed 31) and now considering 1/32 (removed 31) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-11 00:34:14] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 00:34:14] [INFO ] Invariant cache hit.
[2023-03-11 00:34:14] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-11 00:34:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:34:14] [INFO ] Invariant cache hit.
[2023-03-11 00:34:14] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/32 places, 1/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 1/32 places, 1/32 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 35 ms.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-09 finished in 317 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(F((F(p1)&&p0))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 6 transition count 6
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 6 transition count 6
Applied a total of 52 rules in 1 ms. Remains 6 /32 variables (removed 26) and now considering 6/32 (removed 26) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-11 00:34:14] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 00:34:14] [INFO ] Invariant cache hit.
[2023-03-11 00:34:14] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-11 00:34:14] [INFO ] Invariant cache hit.
[2023-03-11 00:34:14] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/32 places, 6/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 6/32 places, 6/32 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s1 1)), p0:(AND (GEQ s3 1) (GEQ s5 1))], 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][false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-10 finished in 190 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(X((X(F(p0))||(p1&&F(p2))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 5 transition count 5
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 5 transition count 5
Applied a total of 54 rules in 1 ms. Remains 5 /32 variables (removed 27) and now considering 5/32 (removed 27) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-11 00:34:14] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 00:34:14] [INFO ] Invariant cache hit.
[2023-03-11 00:34:14] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-11 00:34:14] [INFO ] Invariant cache hit.
[2023-03-11 00:34:14] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/32 places, 5/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 5/32 places, 5/32 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p1:(OR (LT s3 1) (LT s4 1)), p2:(GEQ s1 1), p0:(LT s2 1)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24378 reset in 55 ms.
Product exploration explored 100000 steps with 24417 reset in 63 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 p1) p2 (NOT p0)), (F (G p1)), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-11 finished in 639 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 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 1 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 1 ms. Remains 1 /32 variables (removed 31) and now considering 1/32 (removed 31) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-11 00:34:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:15] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 00:34:15] [INFO ] Invariant cache hit.
[2023-03-11 00:34:15] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-11 00:34:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:34:15] [INFO ] Invariant cache hit.
[2023-03-11 00:34:15] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/32 places, 1/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 1/32 places, 1/32 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-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:(GEQ s0 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-12 finished in 119 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(F(!p0))||(F(!p0)&&p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 3 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /32 variables (removed 29) and now considering 3/32 (removed 29) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:34:15] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 00:34:15] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-11 00:34:15] [INFO ] Invariant cache hit.
[2023-03-11 00:34:15] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-11 00:34:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:34:15] [INFO ] Invariant cache hit.
[2023-03-11 00:34:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/32 places, 3/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 3/32 places, 3/32 transitions.
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s2 1)), p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 52 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 p1 p0), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 6 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-14 finished in 473 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' '!(G((p0 U X(!p0))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /32 variables (removed 30) and now considering 2/32 (removed 30) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 00:34:16] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:34:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 00:34:16] [INFO ] Invariant cache hit.
[2023-03-11 00:34:16] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-11 00:34:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:34:16] [INFO ] Invariant cache hit.
[2023-03-11 00:34:16] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/32 places, 2/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 2/32 places, 2/32 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, true, p0]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33333 reset in 85 ms.
Product exploration explored 100000 steps with 33333 reset in 93 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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[p0, true, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 88 ms :[p0, true, p0]
[2023-03-11 00:34:17] [INFO ] Invariant cache hit.
[2023-03-11 00:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:34:17] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-11 00:34:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 00:34:17] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-11 00:34:17] [INFO ] Invariant cache hit.
[2023-03-11 00:34:17] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 00:34:17] [INFO ] Invariant cache hit.
[2023-03-11 00:34:17] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-11 00:34:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:34:17] [INFO ] Invariant cache hit.
[2023-03-11 00:34:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 2/2 places, 2/2 transitions.
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[p0, true, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 86 ms :[p0, true, p0]
[2023-03-11 00:34:18] [INFO ] Invariant cache hit.
[2023-03-11 00:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:34:18] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 00:34:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-11 00:34:18] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 88 ms :[p0, true, p0]
Product exploration explored 100000 steps with 33333 reset in 45 ms.
Product exploration explored 100000 steps with 33333 reset in 55 ms.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-11 00:34:18] [INFO ] Invariant cache hit.
[2023-03-11 00:34:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 00:34:18] [INFO ] Invariant cache hit.
[2023-03-11 00:34:18] [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.
[2023-03-11 00:34:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:34:18] [INFO ] Invariant cache hit.
[2023-03-11 00:34:18] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Eratosthenes-PT-100-LTLFireability-15 finished in 2351 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' '!(G((p0 U X(!p0))))'
[2023-03-11 00:34:18] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:34:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 00:34:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 32 transitions and 32 arcs took 1 ms.
Total runtime 9097 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1146/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Eratosthenes-PT-100-LTLFireability-15

BK_STOP 1678494860388

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Eratosthenes-PT-100-LTLFireability-15
ltl formula formula --ltl=/tmp/1146/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 32 transitions and 32 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1146/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1146/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1146/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1146/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Eratosthenes-PT-100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855500164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-100.tgz
mv Eratosthenes-PT-100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;