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-167838855400148.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-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855400148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 11:51 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.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 11:53 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 14K 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-020-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678494772118

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-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 00:32:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:32:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:32:53] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-11 00:32:53] [INFO ] Transformed 19 places.
[2023-03-11 00:32:53] [INFO ] Transformed 27 transitions.
[2023-03-11 00:32:53] [INFO ] Parsed PT model containing 19 places and 27 transitions and 81 arcs in 262 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 3 formulas.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA Eratosthenes-PT-020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 20/20 transitions.
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 11 transition count 11
Applied a total of 9 rules in 9 ms. Remains 11 /11 variables (removed 0) and now considering 11/20 (removed 9) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-11 00:32:54] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-11 00:32:54] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-11 00:32:54] [INFO ] Invariant cache hit.
[2023-03-11 00:32:54] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-11 00:32:54] [INFO ] Invariant cache hit.
[2023-03-11 00:32:54] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/11 places, 11/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 11/11 places, 11/20 transitions.
Support contains 10 out of 11 places after structural reductions.
[2023-03-11 00:32:54] [INFO ] Flatten gal took : 11 ms
[2023-03-11 00:32:54] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:32:54] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 17 properties in 9 ms. (steps per millisecond=1 )
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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' '!(G((F(p0) U p1)))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 4 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Applied a total of 1 rules in 3 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 00:32:54] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 00:32:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 00:32:54] [INFO ] Invariant cache hit.
[2023-03-11 00:32:54] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-11 00:32:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:32:54] [INFO ] Invariant cache hit.
[2023-03-11 00:32:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/11 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s2 1), p0:(OR (GEQ s1 1) (AND (GEQ s0 1) (GEQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-00 finished in 376 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((X(X(!(p0 U p1)))&&G(p0))))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 2 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 00:32:55] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 00:32:55] [INFO ] Invariant cache hit.
[2023-03-11 00:32:55] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-11 00:32:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:32:55] [INFO ] Invariant cache hit.
[2023-03-11 00:32:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/11 places, 2/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 2/11 places, 2/11 transitions.
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p0) p1), p1, (NOT p0), p1, p1, (AND (NOT p0) p1)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 3}, { cond=p0, acceptance={0, 1} source=1 dest: 4}, { cond=p0, acceptance={1} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 0}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=5 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 1 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-01 finished in 506 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)&&X((F(p1)&&G(p2)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 4 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 00:32:55] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 00:32:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 00:32:55] [INFO ] Invariant cache hit.
[2023-03-11 00:32:55] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-11 00:32:55] [INFO ] Invariant cache hit.
[2023-03-11 00:32:55] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/11 places, 4/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 1}, { cond=(NOT p2), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(OR (LT s1 1) (LT s3 1)), p0:(GEQ s1 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-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-02 finished in 356 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 U p1)&&X(G(p2)))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5 transition count 5
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5 transition count 5
Applied a total of 12 rules in 2 ms. Remains 5 /11 variables (removed 6) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-11 00:32:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 00:32:56] [INFO ] Invariant cache hit.
[2023-03-11 00:32:56] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-11 00:32:56] [INFO ] Invariant cache hit.
[2023-03-11 00:32:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/11 places, 5/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 5/11 places, 5/11 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(AND (GEQ s1 1) (GEQ s3 1)), p1:(AND (GEQ s1 1) (GEQ s4 1)), p0:(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][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-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-03 finished in 280 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 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 1 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 0 ms. Remains 1 /11 variables (removed 10) and now considering 1/11 (removed 10) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-11 00:32:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:56] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 00:32:56] [INFO ] Invariant cache hit.
[2023-03-11 00:32:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-11 00:32:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:32:56] [INFO ] Invariant cache hit.
[2023-03-11 00:32:56] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/11 places, 1/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 1/11 places, 1/11 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=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]]
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Product exploration explored 100000 steps with 50000 reset in 133 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 : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-020-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-020-LTLFireability-04 finished in 778 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||F(p1)) U X(p0))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 0 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:32:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 00:32:57] [INFO ] Invariant cache hit.
[2023-03-11 00:32:57] [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:32:57] [INFO ] Invariant cache hit.
[2023-03-11 00:32:57] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s2 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 2 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-06 finished in 201 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||X(X(F(p1)))))||(p2&&X(p0)))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5 transition count 5
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5 transition count 5
Applied a total of 12 rules in 1 ms. Remains 5 /11 variables (removed 6) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-11 00:32:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:57] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-11 00:32:57] [INFO ] Invariant cache hit.
[2023-03-11 00:32:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-11 00:32:57] [INFO ] Invariant cache hit.
[2023-03-11 00:32:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/11 places, 5/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 5/11 places, 5/11 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s3 1), p1:(GEQ s2 1), p0:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-07 finished in 216 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||(p1 U p2)))))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /11 variables (removed 6) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-11 00:32:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 00:32:57] [INFO ] Invariant cache hit.
[2023-03-11 00:32:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-11 00:32:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 00:32:57] [INFO ] Invariant cache hit.
[2023-03-11 00:32:57] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/11 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 5/11 places, 5/11 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1), p2:(AND (GEQ s0 1) (GEQ s3 1)), p1:(AND (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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-09 finished in 186 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 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 2 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 00:32:57] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 00:32:57] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-11 00:32:57] [INFO ] Invariant cache hit.
[2023-03-11 00:32:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-11 00:32:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:32:57] [INFO ] Invariant cache hit.
[2023-03-11 00:32:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/11 places, 2/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 2/11 places, 2/11 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 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 159 ms.
Product exploration explored 100000 steps with 50000 reset in 78 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)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 4 factoid took 76 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-020-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-020-LTLFireability-10 finished in 465 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||X(p1))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 0 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:32:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:58] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-11 00:32:58] [INFO ] Invariant cache hit.
[2023-03-11 00:32:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-11 00:32:58] [INFO ] Invariant cache hit.
[2023-03-11 00:32:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s0 1), p1:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-11 finished in 162 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||G(!p1))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 3 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:32:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 00:32:58] [INFO ] Invariant cache hit.
[2023-03-11 00:32:58] [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:32:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:32:58] [INFO ] Invariant cache hit.
[2023-03-11 00:32:58] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33427 reset in 49 ms.
Product exploration explored 100000 steps with 33342 reset in 100 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 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-020-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-020-LTLFireability-13 finished in 479 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' '!((p0 U (!p1||G(p1))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 3 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 0 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-11 00:32:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 00:32:58] [INFO ] Invariant cache hit.
[2023-03-11 00:32:58] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-11 00:32:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:32:58] [INFO ] Invariant cache hit.
[2023-03-11 00:32:58] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, false, (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s0 1), p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-14 finished in 135 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' '!((((p0||X(p1)) U p1)&&X(G(p2))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 0 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 00:32:59] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 00:32:59] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-11 00:32:59] [INFO ] Invariant cache hit.
[2023-03-11 00:32:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-11 00:32:59] [INFO ] Invariant cache hit.
[2023-03-11 00:32:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/11 places, 4/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(GEQ s0 1), p0:(GEQ s3 1), p2:(OR (LT s3 1) (LT 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 2 reset in 1 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-15 finished in 254 ms.
All properties solved by simple procedures.
Total runtime 5592 ms.
ITS solved all properties within timeout

BK_STOP 1678494780654

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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

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-020"
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-020, 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-167838855400148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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