Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280000158.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r175-smll-171636280000158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 19:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 12 19:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 19:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 12 19:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 126K May 18 16:42 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 1716581744507

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 20:15:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 20:15:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 20:15:47] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-24 20:15:47] [INFO ] Transformed 99 places.
[2024-05-24 20:15:47] [INFO ] Transformed 283 transitions.
[2024-05-24 20:15:47] [INFO ] Parsed PT model containing 99 places and 283 transitions and 849 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 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-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 198 place count 27 transition count 27
Iterating global reduction 0 with 33 rules applied. Total rules applied 231 place count 27 transition count 27
Applied a total of 231 rules in 24 ms. Remains 27 /74 variables (removed 47) and now considering 27/211 (removed 184) transitions.
// Phase 1: matrix 27 rows 27 cols
[2024-05-24 20:15:47] [INFO ] Computed 0 invariants in 4 ms
[2024-05-24 20:15:47] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-24 20:15:47] [INFO ] Invariant cache hit.
[2024-05-24 20:15:47] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-24 20:15:47] [INFO ] Invariant cache hit.
[2024-05-24 20:15:47] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/74 places, 27/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 27/74 places, 27/211 transitions.
Support contains 26 out of 27 places after structural reductions.
[2024-05-24 20:15:48] [INFO ] Flatten gal took : 22 ms
[2024-05-24 20:15:48] [INFO ] Flatten gal took : 6 ms
[2024-05-24 20:15:48] [INFO ] Input system was already deterministic with 27 transitions.
Finished random walk after 75 steps, including 0 resets, run visited all 26 properties in 17 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 1 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G((G(p2)||p1)))))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 5 transition count 5
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 5 transition count 5
Applied a total of 44 rules in 1 ms. Remains 5 /27 variables (removed 22) and now considering 5/27 (removed 22) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 20:15:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 20:15:48] [INFO ] Invariant cache hit.
[2024-05-24 20:15:48] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 20:15:48] [INFO ] Invariant cache hit.
[2024-05-24 20:15:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/27 places, 5/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 5/27 places, 5/27 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 351 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-00 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: 3}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s2 1)), p1:(OR (LT s0 1) (LT s2 1)), p2:(OR (LT s3 1) (LT s4 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-00 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((G(p1) U (p0&&G(p1))))) U G(p2)))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3 transition count 3
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3 transition count 3
Applied a total of 48 rules in 1 ms. Remains 3 /27 variables (removed 24) and now considering 3/27 (removed 24) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:15:49] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:49] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 20:15:49] [INFO ] Invariant cache hit.
[2024-05-24 20:15:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 20:15:49] [INFO ] Invariant cache hit.
[2024-05-24 20:15:49] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/27 places, 3/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 3/27 places, 3/27 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s2 1), p0:(LT s1 1), p1:(OR (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 3 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-01 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(p1))))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3 transition count 3
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3 transition count 3
Applied a total of 48 rules in 2 ms. Remains 3 /27 variables (removed 24) and now considering 3/27 (removed 24) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:15:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 20:15:49] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 20:15:49] [INFO ] Invariant cache hit.
[2024-05-24 20:15:49] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-24 20:15:49] [INFO ] Invariant cache hit.
[2024-05-24 20:15:49] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/27 places, 3/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 3/27 places, 3/27 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-02 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4 transition count 4
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4 transition count 4
Applied a total of 46 rules in 2 ms. Remains 4 /27 variables (removed 23) and now considering 4/27 (removed 23) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 20:15:49] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:49] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 20:15:49] [INFO ] Invariant cache hit.
[2024-05-24 20:15:49] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-24 20:15:49] [INFO ] Invariant cache hit.
[2024-05-24 20:15:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/27 places, 4/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 4/27 places, 4/27 transitions.
Stuttering acceptance computed with spot in 119 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 259 ms.
Product exploration explored 100000 steps with 1333 reset in 138 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 (Minato strategy)
Knowledge based reduction with 3 factoid took 18 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 666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Graph (complete) has 0 edges and 27 vertex of which 3 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 4 ms. Remains 3 /27 variables (removed 24) and now considering 3/27 (removed 24) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:15:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 20:15:50] [INFO ] Invariant cache hit.
[2024-05-24 20:15:50] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 20:15:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:50] [INFO ] Invariant cache hit.
[2024-05-24 20:15:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/27 places, 3/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 3/27 places, 3/27 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-05 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:(OR (LT s1 1) (LT s2 1)), p1:(LT s0 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 29555 reset in 224 ms.
Product exploration explored 100000 steps with 29506 reset in 153 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 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-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-05 finished in 657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3 transition count 3
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3 transition count 3
Applied a total of 48 rules in 2 ms. Remains 3 /27 variables (removed 24) and now considering 3/27 (removed 24) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:15:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 20:15:51] [INFO ] Invariant cache hit.
[2024-05-24 20:15:51] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 20:15:51] [INFO ] Invariant cache hit.
[2024-05-24 20:15:51] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/27 places, 3/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 3/27 places, 3/27 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (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][false, false, false]]
Product exploration explored 100000 steps with 31542 reset in 96 ms.
Product exploration explored 100000 steps with 31599 reset in 131 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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-06 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((X(p2)||p1))))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 5 transition count 5
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 5 transition count 5
Applied a total of 44 rules in 2 ms. Remains 5 /27 variables (removed 22) and now considering 5/27 (removed 22) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 20:15:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 20:15:51] [INFO ] Invariant cache hit.
[2024-05-24 20:15:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-24 20:15:51] [INFO ] Invariant cache hit.
[2024-05-24 20:15:51] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/27 places, 5/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 5/27 places, 5/27 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s3 1)), p0:(LT s4 1), p2:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22212 reset in 103 ms.
Product exploration explored 100000 steps with 22183 reset in 98 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) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLFireability-08 finished in 478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Graph (complete) has 0 edges and 27 vertex of which 1 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /27 variables (removed 26) and now considering 1/27 (removed 26) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-24 20:15:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:51] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 20:15:51] [INFO ] Invariant cache hit.
[2024-05-24 20:15:51] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-24 20:15:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:51] [INFO ] Invariant cache hit.
[2024-05-24 20:15:51] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/27 places, 1/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 1/27 places, 1/27 transitions.
Stuttering acceptance computed with spot in 36 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 28 ms.
Product exploration explored 100000 steps with 50000 reset in 42 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 (Minato strategy)
Knowledge based reduction with 4 factoid took 15 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 218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U p2)))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 6 transition count 6
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 6 transition count 6
Applied a total of 42 rules in 1 ms. Remains 6 /27 variables (removed 21) and now considering 6/27 (removed 21) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-24 20:15:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 20:15:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 20:15:52] [INFO ] Invariant cache hit.
[2024-05-24 20:15:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 20:15:52] [INFO ] Invariant cache hit.
[2024-05-24 20:15:52] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/27 places, 6/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 6/27 places, 6/27 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s4 1)), p1:(GEQ s5 1), p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 3 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-10 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||(p1&&F(p2))))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 5 transition count 5
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 5 transition count 5
Applied a total of 44 rules in 2 ms. Remains 5 /27 variables (removed 22) and now considering 5/27 (removed 22) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-24 20:15:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 20:15:52] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 20:15:52] [INFO ] Invariant cache hit.
[2024-05-24 20:15:52] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 20:15:52] [INFO ] Invariant cache hit.
[2024-05-24 20:15:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/27 places, 5/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 5/27 places, 5/27 transitions.
Stuttering acceptance computed with spot in 201 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 24425 reset in 74 ms.
Product exploration explored 100000 steps with 24392 reset in 72 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 (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 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 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(F(p1))))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3 transition count 3
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3 transition count 3
Applied a total of 48 rules in 1 ms. Remains 3 /27 variables (removed 24) and now considering 3/27 (removed 24) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:15:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 20:15:52] [INFO ] Invariant cache hit.
[2024-05-24 20:15:52] [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.
[2024-05-24 20:15:52] [INFO ] Invariant cache hit.
[2024-05-24 20:15:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/27 places, 3/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 3/27 places, 3/27 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s1 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]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-13 finished in 275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3 transition count 3
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3 transition count 3
Applied a total of 48 rules in 1 ms. Remains 3 /27 variables (removed 24) and now considering 3/27 (removed 24) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-24 20:15:53] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 20:15:53] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 20:15:53] [INFO ] Invariant cache hit.
[2024-05-24 20:15:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 20:15:53] [INFO ] Invariant cache hit.
[2024-05-24 20:15:53] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/27 places, 3/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 3/27 places, 3/27 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLFireability-14 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s1 1) (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, 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-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLFireability-14 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!p0))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Graph (complete) has 0 edges and 27 vertex of which 2 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /27 variables (removed 25) and now considering 2/27 (removed 25) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 20:15:53] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 20:15:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 20:15:53] [INFO ] Invariant cache hit.
[2024-05-24 20:15:53] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-24 20:15:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:53] [INFO ] Invariant cache hit.
[2024-05-24 20:15:53] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/27 places, 2/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 2/27 places, 2/27 transitions.
Stuttering acceptance computed with spot in 84 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 112 ms.
Product exploration explored 100000 steps with 33333 reset in 125 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 92 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 90 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 )
Parikh walk visited 0 properties in 0 ms.
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 114 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 82 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 88 ms :[p0, true, p0]
[2024-05-24 20:15:54] [INFO ] Invariant cache hit.
[2024-05-24 20:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 20:15:54] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 20:15:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 20:15:54] [INFO ] Added : 0 causal constraints over 0 iterations in 5 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 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-24 20:15:54] [INFO ] Invariant cache hit.
[2024-05-24 20:15:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 20:15:54] [INFO ] Invariant cache hit.
[2024-05-24 20:15:54] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 20:15:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 20:15:54] [INFO ] Invariant cache hit.
[2024-05-24 20:15:54] [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 70 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 86 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 86 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 )
Parikh walk visited 0 properties in 0 ms.
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 122 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 84 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 89 ms :[p0, true, p0]
[2024-05-24 20:15:54] [INFO ] Invariant cache hit.
[2024-05-24 20:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 20:15:54] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 20:15:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 20:15:55] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 86 ms :[p0, true, p0]
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Product exploration explored 100000 steps with 33333 reset in 55 ms.
Built C files in :
/tmp/ltsmin13278935191795198990
[2024-05-24 20:15:55] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2024-05-24 20:15:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 20:15:55] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2024-05-24 20:15:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 20:15:55] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2024-05-24 20:15:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 20:15:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13278935191795198990
Running compilation step : cd /tmp/ltsmin13278935191795198990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 264 ms.
Running link step : cd /tmp/ltsmin13278935191795198990;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13278935191795198990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12643704780117692444.hoa' '--buchi-type=spotba'
LTSmin run took 216 ms.
FORMULA Eratosthenes-PT-100-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Eratosthenes-PT-100-LTLFireability-15 finished in 2400 ms.
All properties solved by simple procedures.
Total runtime 8874 ms.

BK_STOP 1716581757460

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r175-smll-171636280000158"
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 ;