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.r519-tall-167987244900164.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 lolaxred
Input is CryptoMiner-PT-D03N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244900164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.3K Mar 31 16:48 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 CryptoMiner-PT-D03N100-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D03N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680840262771

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 04:04:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 04:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:04:24] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-04-07 04:04:24] [INFO ] Transformed 12 places.
[2023-04-07 04:04:24] [INFO ] Transformed 12 transitions.
[2023-04-07 04:04:24] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 13 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 04:04:24] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 04:04:24] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-04-07 04:04:24] [INFO ] Invariant cache hit.
[2023-04-07 04:04:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:24] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-04-07 04:04:24] [INFO ] Invariant cache hit.
[2023-04-07 04:04:24] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 11/12 places, 12/12 transitions.
Support contains 8 out of 11 places after structural reductions.
[2023-04-07 04:04:24] [INFO ] Flatten gal took : 11 ms
[2023-04-07 04:04:24] [INFO ] Flatten gal took : 3 ms
[2023-04-07 04:04:24] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:04:24] [INFO ] Invariant cache hit.
[2023-04-07 04:04:24] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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(p1)&&p0)))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:25] [INFO ] Invariant cache hit.
[2023-04-07 04:04:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 04:04:25] [INFO ] Invariant cache hit.
[2023-04-07 04:04:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:25] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-07 04:04:25] [INFO ] Invariant cache hit.
[2023-04-07 04:04:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 11/11 places, 12/12 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 259 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p0:(AND (GEQ s0 1) (GEQ s7 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-00 finished in 367 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))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:25] [INFO ] Invariant cache hit.
[2023-04-07 04:04:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 04:04:25] [INFO ] Invariant cache hit.
[2023-04-07 04:04:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:25] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 04:04:25] [INFO ] Invariant cache hit.
[2023-04-07 04:04:25] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3443 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=688 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:26] [INFO ] Invariant cache hit.
[2023-04-07 04:04:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 04:04:26] [INFO ] Invariant cache hit.
[2023-04-07 04:04:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:26] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 04:04:26] [INFO ] Invariant cache hit.
[2023-04-07 04:04:26] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3439 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=859 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 130 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 10 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:04:27] [INFO ] Invariant cache hit.
[2023-04-07 04:04:27] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48 ms. Remains : 11/11 places, 12/12 transitions.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:27] [INFO ] Invariant cache hit.
[2023-04-07 04:04:27] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 04:04:27] [INFO ] Invariant cache hit.
[2023-04-07 04:04:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:27] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-04-07 04:04:27] [INFO ] Invariant cache hit.
[2023-04-07 04:04:27] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-01 finished in 2503 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(F(p1))&&p0)))))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:27] [INFO ] Invariant cache hit.
[2023-04-07 04:04:27] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 04:04:27] [INFO ] Invariant cache hit.
[2023-04-07 04:04:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:28] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 04:04:28] [INFO ] Invariant cache hit.
[2023-04-07 04:04:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-02 finished in 391 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)&&X((F(G(p2))||p1))))'
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:28] [INFO ] Invariant cache hit.
[2023-04-07 04:04:28] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 04:04:28] [INFO ] Invariant cache hit.
[2023-04-07 04:04:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:28] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-04-07 04:04:28] [INFO ] Invariant cache hit.
[2023-04-07 04:04:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(OR (GEQ s7 1) (GEQ s8 1) (GEQ s9 1)), p2:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D03N100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-04 finished in 454 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))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:28] [INFO ] Invariant cache hit.
[2023-04-07 04:04:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 04:04:28] [INFO ] Invariant cache hit.
[2023-04-07 04:04:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:28] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-07 04:04:28] [INFO ] Invariant cache hit.
[2023-04-07 04:04:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s7 1) (LT s8 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-05 finished in 198 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))))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:29] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-06 finished in 202 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(G(!p0)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 4 / 11 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 5 ms. Remains 8 /11 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-04-07 04:04:29] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 04:04:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:29] [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.
[2023-04-07 04:04:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 8/11 places, 9/12 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s4 1) (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-07 finished in 125 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)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 04:04:29] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 04:04:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:29] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-08 finished in 200 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 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:29] [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-04-07 04:04:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:04:29] [INFO ] Invariant cache hit.
[2023-04-07 04:04:29] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=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:(AND (GEQ s0 1) (GEQ s7 1)), p1:(LT s7 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 0 reset in 87 ms.
Product exploration explored 100000 steps with 5 reset in 83 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Finished random walk after 102 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 268 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
[2023-04-07 04:04:30] [INFO ] Invariant cache hit.
[2023-04-07 04:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-07 04:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-07 04:04:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-07 04:04:30] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 04:04:30] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
[2023-04-07 04:04:30] [INFO ] Invariant cache hit.
[2023-04-07 04:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:30] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-07 04:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:30] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 04:04:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-07 04:04:30] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 04:04:30] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:30] [INFO ] Invariant cache hit.
[2023-04-07 04:04:30] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-04-07 04:04:30] [INFO ] Invariant cache hit.
[2023-04-07 04:04:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:30] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-04-07 04:04:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:04:30] [INFO ] Invariant cache hit.
[2023-04-07 04:04:30] [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 64 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 257 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 396 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
[2023-04-07 04:04:32] [INFO ] Invariant cache hit.
[2023-04-07 04:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-07 04:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 04:04:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-07 04:04:32] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-07 04:04:32] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2023-04-07 04:04:32] [INFO ] Invariant cache hit.
[2023-04-07 04:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-07 04:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 04:04:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 04:04:32] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-07 04:04:32] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 90 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:32] [INFO ] Invariant cache hit.
[2023-04-07 04:04:32] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 04:04:32] [INFO ] Invariant cache hit.
[2023-04-07 04:04:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:32] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 04:04:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:04:32] [INFO ] Invariant cache hit.
[2023-04-07 04:04:32] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-09 finished in 2964 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||X(p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:32] [INFO ] Invariant cache hit.
[2023-04-07 04:04:32] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-04-07 04:04:32] [INFO ] Invariant cache hit.
[2023-04-07 04:04:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:32] [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-04-07 04:04:32] [INFO ] Invariant cache hit.
[2023-04-07 04:04:32] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s10 1), p1:(GEQ 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 17557 reset in 51 ms.
Product exploration explored 100000 steps with 17666 reset in 123 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 04:04:33] [INFO ] Invariant cache hit.
[2023-04-07 04:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:33] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 04:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 04:04:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-04-07 04:04:33] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 04:04:33] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:33] [INFO ] Invariant cache hit.
[2023-04-07 04:04:33] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 04:04:33] [INFO ] Invariant cache hit.
[2023-04-07 04:04:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-04-07 04:04:33] [INFO ] Invariant cache hit.
[2023-04-07 04:04:33] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 04:04:34] [INFO ] Invariant cache hit.
[2023-04-07 04:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-07 04:04:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 04:04:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 04:04:34] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 04:04:34] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17614 reset in 57 ms.
Product exploration explored 100000 steps with 17537 reset in 59 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:04:34] [INFO ] Invariant cache hit.
[2023-04-07 04:04:34] [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 23 ms. Remains : 11/11 places, 12/12 transitions.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:34] [INFO ] Invariant cache hit.
[2023-04-07 04:04:34] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 04:04:34] [INFO ] Invariant cache hit.
[2023-04-07 04:04:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 04:04:34] [INFO ] Invariant cache hit.
[2023-04-07 04:04:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-10 finished in 2255 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(!p1)||p0))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:34] [INFO ] Invariant cache hit.
[2023-04-07 04:04:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 04:04:34] [INFO ] Invariant cache hit.
[2023-04-07 04:04:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:34] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-07 04:04:34] [INFO ] Invariant cache hit.
[2023-04-07 04:04:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 129 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s0 1) (GEQ s7 1)), p0:(OR (LT s0 1) (LT s7 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][false, false, false, false]]
Product exploration explored 100000 steps with 20190 reset in 56 ms.
Stack based approach found an accepted trace after 895 steps with 186 reset with depth 8 and stack size 8 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-11 finished in 260 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||(p0&&X(!p0))))))))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:35] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:35] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0, p0]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s10 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][false, false, false, false]]
Product exploration explored 100000 steps with 23692 reset in 48 ms.
Stack based approach found an accepted trace after 117 steps with 25 reset with depth 15 and stack size 15 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-12 finished in 239 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))||G((X(p1)&&F(p2)))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:35] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:35] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s10 1), p2:(LT s8 1), p1:(AND (GEQ s0 1) (GEQ s7 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]]
Product exploration explored 100000 steps with 302 reset in 60 ms.
Stack based approach found an accepted trace after 18 steps with 3 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-13 finished in 312 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 G((!p1||X(!p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:35] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:35] [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-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:35] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 178 ms :[p1, false, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s7 1), p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 40 steps with 12 reset in 1 ms.
FORMULA CryptoMiner-PT-D03N100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-14 finished in 261 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))))'
Found a Lengthening insensitive property : CryptoMiner-PT-D03N100-LTLFireability-01
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:35] [INFO ] Invariant cache hit.
[2023-04-07 04:04:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 04:04:36] [INFO ] Invariant cache hit.
[2023-04-07 04:04:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:36] [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.
[2023-04-07 04:04:36] [INFO ] Invariant cache hit.
[2023-04-07 04:04:36] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62 ms. Remains : 11/11 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 83 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :0
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:36] [INFO ] Invariant cache hit.
[2023-04-07 04:04:36] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 04:04:36] [INFO ] Invariant cache hit.
[2023-04-07 04:04:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 04:04:36] [INFO ] Invariant cache hit.
[2023-04-07 04:04:36] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3443 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1721 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 69 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:04:37] [INFO ] Invariant cache hit.
[2023-04-07 04:04:37] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33 ms. Remains : 11/11 places, 12/12 transitions.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:37] [INFO ] Invariant cache hit.
[2023-04-07 04:04:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 04:04:37] [INFO ] Invariant cache hit.
[2023-04-07 04:04:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:37] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-04-07 04:04:37] [INFO ] Invariant cache hit.
[2023-04-07 04:04:37] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-01 finished in 2126 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)))))'
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||X(p1)))))'
Found a Shortening insensitive property : CryptoMiner-PT-D03N100-LTLFireability-10
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:38] [INFO ] Invariant cache hit.
[2023-04-07 04:04:38] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 04:04:38] [INFO ] Invariant cache hit.
[2023-04-07 04:04:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:38] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 04:04:38] [INFO ] Invariant cache hit.
[2023-04-07 04:04:38] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 75 ms. Remains : 11/11 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s10 1), p1:(GEQ 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, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17601 reset in 55 ms.
Product exploration explored 100000 steps with 17607 reset in 56 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 104 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 04:04:38] [INFO ] Invariant cache hit.
[2023-04-07 04:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-07 04:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-07 04:04:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 04:04:39] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-07 04:04:39] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:39] [INFO ] Invariant cache hit.
[2023-04-07 04:04:39] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-04-07 04:04:39] [INFO ] Invariant cache hit.
[2023-04-07 04:04:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:39] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-04-07 04:04:39] [INFO ] Invariant cache hit.
[2023-04-07 04:04:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 104 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 04:04:39] [INFO ] Invariant cache hit.
[2023-04-07 04:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-07 04:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:04:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-04-07 04:04:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-07 04:04:39] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 04:04:39] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17620 reset in 59 ms.
Product exploration explored 100000 steps with 17537 reset in 58 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:04:40] [INFO ] Invariant cache hit.
[2023-04-07 04:04:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25 ms. Remains : 11/11 places, 12/12 transitions.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:04:40] [INFO ] Invariant cache hit.
[2023-04-07 04:04:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 04:04:40] [INFO ] Invariant cache hit.
[2023-04-07 04:04:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:04:40] [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.
[2023-04-07 04:04:40] [INFO ] Invariant cache hit.
[2023-04-07 04:04:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D03N100-LTLFireability-10 finished in 2252 ms.
[2023-04-07 04:04:40] [INFO ] Flatten gal took : 3 ms
[2023-04-07 04:04:40] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 04:04:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 12 transitions and 33 arcs took 0 ms.
Total runtime 16182 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-PT-D03N100
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA CryptoMiner-PT-D03N100-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CryptoMiner-PT-D03N100-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680840301749

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CryptoMiner-PT-D03N100-LTLFireability-01
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D03N100-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D03N100-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CryptoMiner-PT-D03N100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/900 13/32 CryptoMiner-PT-D03N100-LTLFireability-01 1902654 m, 380530 m/sec, 8397627 t fired, .

Time elapsed: 5 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D03N100-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D03N100-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CryptoMiner-PT-D03N100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/900 22/32 CryptoMiner-PT-D03N100-LTLFireability-01 3331763 m, 285821 m/sec, 15482769 t fired, .

Time elapsed: 10 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D03N100-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
CryptoMiner-PT-D03N100-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CryptoMiner-PT-D03N100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/900 31/32 CryptoMiner-PT-D03N100-LTLFireability-01 4776855 m, 289018 m/sec, 22315224 t fired, .

Time elapsed: 15 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for CryptoMiner-PT-D03N100-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D03N100-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D03N100-LTLFireability-09: CONJ 0 2 0 0 2 0 0 0
CryptoMiner-PT-D03N100-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 11 (type EXCL) for 10 CryptoMiner-PT-D03N100-LTLFireability-10
lola: time limit : 1193 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for CryptoMiner-PT-D03N100-LTLFireability-10
lola: result : true
lola: markings : 453629
lola: fired transitions : 632828
lola: time used : 0.000000
lola: memory pages used : 3
lola: LAUNCH task # 8 (type EXCL) for 3 CryptoMiner-PT-D03N100-LTLFireability-09
lola: time limit : 1790 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for CryptoMiner-PT-D03N100-LTLFireability-09
lola: result : false
lola: markings : 2
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D03N100-LTLFireability-01: LTL unknown AGGR
CryptoMiner-PT-D03N100-LTLFireability-09: CONJ false LTL model checker
CryptoMiner-PT-D03N100-LTLFireability-10: LTL true LTL model checker


Time elapsed: 20 secs. Pages in use: 32

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="CryptoMiner-PT-D03N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CryptoMiner-PT-D03N100, 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 r519-tall-167987244900164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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