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.r517-tall-167987243500180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CryptoMiner-PT-D05N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243500180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 38K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 277K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 7.8K 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-D05N100-LTLFireability-00
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-01
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-02
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-03
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-04
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-05
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-06
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-07
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-08
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-09
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-10
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-11
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-12
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-13
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-14
FORMULA_NAME CryptoMiner-PT-D05N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680881240951

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D05N100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 15:27:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 15:27:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 15:27:22] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-04-07 15:27:22] [INFO ] Transformed 18 places.
[2023-04-07 15:27:22] [INFO ] Transformed 18 transitions.
[2023-04-07 15:27:22] [INFO ] Parsed PT model containing 18 places and 18 transitions and 52 arcs in 77 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 3 formulas.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 13 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 15:27:22] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 15:27:22] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-04-07 15:27:22] [INFO ] Invariant cache hit.
[2023-04-07 15:27:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:22] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-04-07 15:27:22] [INFO ] Invariant cache hit.
[2023-04-07 15:27:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 17/18 places, 18/18 transitions.
Support contains 10 out of 17 places after structural reductions.
[2023-04-07 15:27:23] [INFO ] Flatten gal took : 17 ms
[2023-04-07 15:27:23] [INFO ] Flatten gal took : 4 ms
[2023-04-07 15:27:23] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10019 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=385 ) properties (out of 10) seen :9
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=133 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 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(X(G(p1)))))'
Support contains 7 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:23] [INFO ] Invariant cache hit.
[2023-04-07 15:27:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 15:27:23] [INFO ] Invariant cache hit.
[2023-04-07 15:27:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:23] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 15:27:23] [INFO ] Invariant cache hit.
[2023-04-07 15:27:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 17/17 places, 18/18 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 247 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p1:(LT s16 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 0 reset in 207 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-00 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 8 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:23] [INFO ] Invariant cache hit.
[2023-04-07 15:27:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 15:27:24] [INFO ] Invariant cache hit.
[2023-04-07 15:27:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:24] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 15:27:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 15:27:24] [INFO ] Invariant cache hit.
[2023-04-07 15:27:24] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-01 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:(LT s16 1), p1:(AND (GEQ s16 1) (OR (LT s0 1) (LT s11 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 2 reset in 131 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-01 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||F(!p1))) U X(G(p1)))))'
Support contains 7 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:24] [INFO ] Invariant cache hit.
[2023-04-07 15:27:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 15:27:24] [INFO ] Invariant cache hit.
[2023-04-07 15:27:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:24] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 15:27:24] [INFO ] Invariant cache hit.
[2023-04-07 15:27:24] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), false, (AND p1 (NOT p0)), p1]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p0:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20017 reset in 80 ms.
Stack based approach found an accepted trace after 36072 steps with 7247 reset with depth 9 and stack size 9 in 34 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-02 finished in 509 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((G(p0)&&X((X(G(p2))&&p1))))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:24] [INFO ] Invariant cache hit.
[2023-04-07 15:27:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 15:27:24] [INFO ] Invariant cache hit.
[2023-04-07 15:27:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:24] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 15:27:24] [INFO ] Invariant cache hit.
[2023-04-07 15:27:24] [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 : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 2}, { cond=p0, acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1)), p1:(AND (GEQ s0 1) (GEQ s11 1)), p2:(LT s16 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-03 finished in 531 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)&&F(G(!p1))))'
Support contains 7 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 5 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:25] [INFO ] Invariant cache hit.
[2023-04-07 15:27:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 15:27:25] [INFO ] Invariant cache hit.
[2023-04-07 15:27:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:25] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 15:27:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:27:25] [INFO ] Invariant cache hit.
[2023-04-07 15:27:25] [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 98 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1)), p1:(LT s16 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 72 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 84 in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-06 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' '!(G(F(!p0)))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:25] [INFO ] Invariant cache hit.
[2023-04-07 15:27:25] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 15:27:25] [INFO ] Invariant cache hit.
[2023-04-07 15:27:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:25] [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 15:27:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:27:25] [INFO ] Invariant cache hit.
[2023-04-07 15:27:25] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6 reset in 69 ms.
Product exploration explored 100000 steps with 2 reset in 155 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
[2023-04-07 15:27:26] [INFO ] Invariant cache hit.
[2023-04-07 15:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 15:27:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 15:27:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 15:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 15:27:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-07 15:27:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:26] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 15:27:26] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 15:27:26] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:26] [INFO ] Invariant cache hit.
[2023-04-07 15:27:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 15:27:26] [INFO ] Invariant cache hit.
[2023-04-07 15:27:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 15:27:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:27:26] [INFO ] Invariant cache hit.
[2023-04-07 15:27:26] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 17/17 places, 18/18 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
[2023-04-07 15:27:27] [INFO ] Invariant cache hit.
[2023-04-07 15:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 15:27:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-07 15:27:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 15:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 15:27:27] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-07 15:27:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:27] [INFO ] [Nat]Added 5 Read/Feed constraints in 6 ms returned sat
[2023-04-07 15:27:27] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 15:27:27] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 53 ms :[p0, p0]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Built C files in :
/tmp/ltsmin18167787506318250078
[2023-04-07 15:27:27] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-04-07 15:27:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 15:27:27] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-04-07 15:27:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 15:27:27] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-04-07 15:27:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 15:27:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18167787506318250078
Running compilation step : cd /tmp/ltsmin18167787506318250078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin18167787506318250078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18167787506318250078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7200136312660846895.hoa' '--buchi-type=spotba'
LTSmin run took 164 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-07 finished in 2475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:28] [INFO ] Invariant cache hit.
[2023-04-07 15:27:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 15:27:28] [INFO ] Invariant cache hit.
[2023-04-07 15:27:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-04-07 15:27:28] [INFO ] Invariant cache hit.
[2023-04-07 15:27:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s5 1), p0:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-08 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' '!(X(G((G(F(!p0)) U p1))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:28] [INFO ] Invariant cache hit.
[2023-04-07 15:27:28] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 15:27:28] [INFO ] Invariant cache hit.
[2023-04-07 15:27:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:28] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 15:27:28] [INFO ] Invariant cache hit.
[2023-04-07 15:27:28] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), p0, p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s11 1)), p0:(LT s16 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 49 reset in 77 ms.
Stack based approach found an accepted trace after 336 steps with 17 reset with depth 18 and stack size 18 in 1 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-09 finished in 370 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((G(p0)||X(p1))))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:28] [INFO ] Invariant cache hit.
[2023-04-07 15:27:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 15:27:28] [INFO ] Invariant cache hit.
[2023-04-07 15:27:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:28] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 15:27:28] [INFO ] Invariant cache hit.
[2023-04-07 15:27:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LT s16 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-10 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(!p0)) U (p1&&(!p1 U !p0))))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Graph (trivial) has 8 edges and 17 vertex of which 6 / 17 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 7 ms. Remains 12 /17 variables (removed 5) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 12 cols
[2023-04-07 15:27:29] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 15:27:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 15:27:29] [INFO ] Invariant cache hit.
[2023-04-07 15:27:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 15:27:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:27:29] [INFO ] Invariant cache hit.
[2023-04-07 15:27:29] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/17 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 12/17 places, 13/18 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) p0), p0, true]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s11 1), p0:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-11 finished in 171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&G(!p1)) U (X(F(!p2))||G(p3))))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-04-07 15:27:29] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 15:27:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 15:27:29] [INFO ] Invariant cache hit.
[2023-04-07 15:27:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 15:27:29] [INFO ] Invariant cache hit.
[2023-04-07 15:27:29] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND p2 (NOT p3)), p2, (AND p2 p1), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p3 p0) (AND p3 p1)), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p1 p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p3 p0 p2) (AND p3 p1 p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND p3 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s16 1)), p0:(LT s5 1), p1:(LT s1 1), p2:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5062 reset in 77 ms.
Stack based approach found an accepted trace after 958 steps with 52 reset with depth 26 and stack size 26 in 1 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-14 finished in 345 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&&(G(!p0)||X(X(G(p1)))))) U !p1))'
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:29] [INFO ] Invariant cache hit.
[2023-04-07 15:27:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 15:27:29] [INFO ] Invariant cache hit.
[2023-04-07 15:27:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:29] [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 15:27:29] [INFO ] Invariant cache hit.
[2023-04-07 15:27:29] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 17/17 places, 18/18 transitions.
Stuttering acceptance computed with spot in 167 ms :[p1, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D05N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 3}, { cond=p0, acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s13 1), p0:(AND (GEQ s0 1) (GEQ s11 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 116 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Detected a total of 10/17 stabilizing places and 11/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 492 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[p1, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10025 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1002 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 15:27:30] [INFO ] Invariant cache hit.
[2023-04-07 15:27:30] [INFO ] After 22ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 596 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[p1]
Stuttering acceptance computed with spot in 26 ms :[p1]
[2023-04-07 15:27:31] [INFO ] Invariant cache hit.
[2023-04-07 15:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 15:27:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-07 15:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 15:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 15:27:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-07 15:27:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 15:27:31] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 15:27:31] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG p1
Support contains 1 out of 17 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-04-07 15:27:31] [INFO ] Invariant cache hit.
[2023-04-07 15:27:31] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 15:27:31] [INFO ] Invariant cache hit.
[2023-04-07 15:27:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:31] [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 15:27:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 15:27:31] [INFO ] Invariant cache hit.
[2023-04-07 15:27:31] [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 78 ms. Remains : 17/17 places, 18/18 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 42 edges and 17 vertex of which 7 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 11 stable transitions
Detected a total of 10/17 stabilizing places and 11/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p1]
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p1]
Stuttering acceptance computed with spot in 35 ms :[p1]
[2023-04-07 15:27:32] [INFO ] Invariant cache hit.
[2023-04-07 15:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 15:27:32] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-04-07 15:27:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 15:27:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 15:27:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-07 15:27:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:27:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 15:27:32] [INFO ] Computed and/alt/rep : 15/25/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 15:27:32] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 30 ms :[p1]
Product exploration explored 100000 steps with 12510 reset in 68 ms.
Stack based approach found an accepted trace after 745 steps with 97 reset with depth 37 and stack size 37 in 2 ms.
FORMULA CryptoMiner-PT-D05N100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D05N100-LTLFireability-15 finished in 2605 ms.
All properties solved by simple procedures.
Total runtime 9837 ms.

BK_STOP 1680881253126

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D05N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CryptoMiner-PT-D05N100, 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 r517-tall-167987243500180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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