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-167987244900139.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-COL-D20N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244900139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.4K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 13K 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-COL-D20N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680839471831

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D20N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 03:51:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:51:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:51:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 03:51:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 03:51:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 408 ms
[2023-04-07 03:51:13] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 63 PT places and 105.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 114 ms.
Working with output stream class java.io.PrintStream
[2023-04-07 03:51:14] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2023-04-07 03:51:14] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
Incomplete random walk after 10047 steps, including 175 resets, run finished after 34 ms. (steps per millisecond=295 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 24 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 03:51:14] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 03:51:14] [INFO ] Computed 0 invariants in 5 ms
[2023-04-07 03:51:14] [INFO ] After 96ms 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.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-04-07 03:51:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-04-07 03:51:14] [INFO ] Flatten gal took : 13 ms
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:51:14] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 21)]] contains successor/predecessor on variables of sort CD
[2023-04-07 03:51:14] [INFO ] Unfolded HLPN to a Petri net with 63 places and 63 transitions 187 arcs in 7 ms.
[2023-04-07 03:51:14] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 03:51:14] [INFO ] Computed 1 invariants in 3 ms
[2023-04-07 03:51:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-04-07 03:51:14] [INFO ] Invariant cache hit.
[2023-04-07 03:51:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:14] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-04-07 03:51:14] [INFO ] Invariant cache hit.
[2023-04-07 03:51:14] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2023-04-07 03:51:14] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:51:14] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:51:14] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 3471 steps, including 1 resets, run visited all 14 properties in 15 ms. (steps per millisecond=231 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.5 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(!p0))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:14] [INFO ] Invariant cache hit.
[2023-04-07 03:51:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-04-07 03:51:14] [INFO ] Invariant cache hit.
[2023-04-07 03:51:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:15] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-04-07 03:51:15] [INFO ] Invariant cache hit.
[2023-04-07 03:51:15] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 63/63 places, 63/63 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 228 ms :[p0, p0, p0, true]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GT (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 349 ms.
Product exploration explored 100000 steps with 0 reset in 373 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[true, 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-00 finished in 1412 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(((G((p0||X(p1))) U !p0) U (!p2 U p3))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:16] [INFO ] Invariant cache hit.
[2023-04-07 03:51:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 03:51:16] [INFO ] Invariant cache hit.
[2023-04-07 03:51:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-07 03:51:16] [INFO ] Invariant cache hit.
[2023-04-07 03:51:16] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 480 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33...], 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 480 ms.
Product exploration explored 100000 steps with 0 reset in 528 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 11 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=559 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 03:51:18] [INFO ] Invariant cache hit.
[2023-04-07 03:51:18] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 03:51:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-04-07 03:51:18] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (G (NOT (AND p0 p2 (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p3)), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 377 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:19] [INFO ] Invariant cache hit.
[2023-04-07 03:51:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 03:51:19] [INFO ] Invariant cache hit.
[2023-04-07 03:51:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:19] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-07 03:51:19] [INFO ] Invariant cache hit.
[2023-04-07 03:51:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10071 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1678 ) properties (out of 7) seen :6
Finished Best-First random walk after 5552 steps, including 1 resets, run visited all 1 properties in 17 ms. (steps per millisecond=326 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (AND p0 (NOT p3)))]
Knowledge based reduction with 3 factoid took 400 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 446 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 356 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 355 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 312 ms.
Product exploration explored 100000 steps with 0 reset in 332 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 361 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 10 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:23] [INFO ] Invariant cache hit.
[2023-04-07 03:51:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:23] [INFO ] Invariant cache hit.
[2023-04-07 03:51:23] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 03:51:23] [INFO ] Invariant cache hit.
[2023-04-07 03:51:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:23] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-04-07 03:51:23] [INFO ] Invariant cache hit.
[2023-04-07 03:51:23] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-01 finished in 7157 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&&F(!p0)) U G(p1)))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:23] [INFO ] Invariant cache hit.
[2023-04-07 03:51:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 03:51:23] [INFO ] Invariant cache hit.
[2023-04-07 03:51:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:23] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-04-07 03:51:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:23] [INFO ] Invariant cache hit.
[2023-04-07 03:51:23] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(OR (LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 308 ms.
Product exploration explored 100000 steps with 0 reset in 509 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 106 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=437 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 03:51:24] [INFO ] Invariant cache hit.
[2023-04-07 03:51:24] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:51:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-04-07 03:51:24] [INFO ] After 35ms SMT Verify possible using all constraints in natural 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 (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 15 factoid took 147 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-02 finished in 1673 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)))'
Support contains 21 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 03:51:25] [INFO ] Computed 0 invariants in 8 ms
[2023-04-07 03:51:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 03:51:25] [INFO ] Invariant cache hit.
[2023-04-07 03:51:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:25] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-04-07 03:51:25] [INFO ] Invariant cache hit.
[2023-04-07 03:51:25] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 0 reset in 193 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 3456 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1728 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-04-07 03:51:26] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-03 finished in 1099 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((F(!p1)&&F(G(p2)))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 03:51:26] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 03:51:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 03:51:26] [INFO ] Invariant cache hit.
[2023-04-07 03:51:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-04-07 03:51:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:51:26] [INFO ] Invariant cache hit.
[2023-04-07 03:51:26] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s...], 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 239 ms.
Product exploration explored 100000 steps with 0 reset in 340 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10086 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1440 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 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 03:51:27] [INFO ] Invariant cache hit.
[2023-04-07 03:51:27] [INFO ] After 28ms 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 (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 189 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-04-07 03:51:27] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 10 factoid took 241 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-05 finished in 1699 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)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:27] [INFO ] Invariant cache hit.
[2023-04-07 03:51:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 03:51:27] [INFO ] Invariant cache hit.
[2023-04-07 03:51:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-04-07 03:51:27] [INFO ] Invariant cache hit.
[2023-04-07 03:51:28] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33...], 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Product exploration explored 100000 steps with 1 reset in 220 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3354 ) properties (out of 1) seen :0
Finished Best-First random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 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 23 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
[2023-04-07 03:51:28] [INFO ] Invariant cache hit.
[2023-04-07 03:51:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 03:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:51:28] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
Proved EG p0
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-06 finished in 1157 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 21 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 1 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 03:51:29] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 03:51:29] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 03:51:29] [INFO ] Invariant cache hit.
[2023-04-07 03:51:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:29] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-04-07 03:51:29] [INFO ] Invariant cache hit.
[2023-04-07 03:51:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-09 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:(GT 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41))], 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-COL-D20N100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-09 finished in 243 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)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 2 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:29] [INFO ] Invariant cache hit.
[2023-04-07 03:51:29] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-04-07 03:51:29] [INFO ] Invariant cache hit.
[2023-04-07 03:51:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:29] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-04-07 03:51:29] [INFO ] Invariant cache hit.
[2023-04-07 03:51:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 247 ms.
Product exploration explored 100000 steps with 0 reset in 256 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) 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 p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-10 finished in 960 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(!p1)))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (trivial) has 21 edges and 63 vertex of which 21 / 63 are part of one of the 1 SCC in 4 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 10 ms. Remains 43 /63 variables (removed 20) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 43 cols
[2023-04-07 03:51:30] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 03:51:30] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 03:51:30] [INFO ] Invariant cache hit.
[2023-04-07 03:51:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-04-07 03:51:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:30] [INFO ] Invariant cache hit.
[2023-04-07 03:51:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/63 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 43/63 places, 43/63 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p0:(LEQ (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 15 ms.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-11 finished in 388 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 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 03:51:30] [INFO ] Computed 0 invariants in 5 ms
[2023-04-07 03:51:30] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-04-07 03:51:30] [INFO ] Invariant cache hit.
[2023-04-07 03:51:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:30] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-04-07 03:51:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:30] [INFO ] Invariant cache hit.
[2023-04-07 03:51:30] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-12 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:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], 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 0 reset in 183 ms.
Product exploration explored 100000 steps with 0 reset in 348 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 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 69 ms :[p0, p0]
Incomplete random walk after 10031 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3343 ) properties (out of 1) seen :0
Finished Best-First random walk after 396 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=198 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 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 61 ms :[p0, p0]
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
[2023-04-07 03:51:31] [INFO ] Invariant cache hit.
Proved EG p0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-12 finished in 1330 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((X(!p1)||p0))) U G(p2)))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 03:51:31] [INFO ] Computed 1 invariants in 2 ms
[2023-04-07 03:51:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 03:51:32] [INFO ] Invariant cache hit.
[2023-04-07 03:51:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:32] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 03:51:32] [INFO ] Invariant cache hit.
[2023-04-07 03:51:32] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0)), p1, true, (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 229 ms.
Product exploration explored 100000 steps with 0 reset in 259 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 198 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0)), p1, true, (AND (NOT p2) p1), (NOT p2)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1006 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 03:51:33] [INFO ] Invariant cache hit.
[2023-04-07 03:51:33] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 03:51:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-04-07 03:51:33] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND p2 p1))), (F (NOT p2)), (F p0)]
Knowledge based reduction with 12 factoid took 442 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:34] [INFO ] Invariant cache hit.
[2023-04-07 03:51:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 03:51:34] [INFO ] Invariant cache hit.
[2023-04-07 03:51:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:34] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 03:51:34] [INFO ] Invariant cache hit.
[2023-04-07 03:51:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Finished random walk after 101 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 274 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:36] [INFO ] Invariant cache hit.
[2023-04-07 03:51:36] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:36] [INFO ] Invariant cache hit.
[2023-04-07 03:51:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 03:51:36] [INFO ] Invariant cache hit.
[2023-04-07 03:51:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 03:51:36] [INFO ] Invariant cache hit.
[2023-04-07 03:51:36] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-13 finished in 4668 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||X(p1)))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 1 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 03:51:36] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 03:51:36] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-04-07 03:51:36] [INFO ] Invariant cache hit.
[2023-04-07 03:51:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-04-07 03:51:36] [INFO ] Invariant cache hit.
[2023-04-07 03:51:36] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 0 reset in 258 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 145 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10078 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=775 ) properties (out of 5) seen :2
Finished Best-First random walk after 421 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=210 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 347 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 42 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:38] [INFO ] Invariant cache hit.
[2023-04-07 03:51:38] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 03:51:38] [INFO ] Invariant cache hit.
[2023-04-07 03:51:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-04-07 03:51:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:38] [INFO ] Invariant cache hit.
[2023-04-07 03:51:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 125 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1703 steps, including 3 resets, run visited all 5 properties in 2 ms. (steps per millisecond=851 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 311 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 288 ms.
Product exploration explored 100000 steps with 0 reset in 364 ms.
Support contains 42 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:39] [INFO ] Invariant cache hit.
[2023-04-07 03:51:39] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 03:51:39] [INFO ] Invariant cache hit.
[2023-04-07 03:51:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:39] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-04-07 03:51:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:51:39] [INFO ] Invariant cache hit.
[2023-04-07 03:51:39] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-14 finished in 3328 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 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2023-04-07 03:51:39] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 03:51:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 03:51:40] [INFO ] Invariant cache hit.
[2023-04-07 03:51:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:40] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-07 03:51:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:40] [INFO ] Invariant cache hit.
[2023-04-07 03:51:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62)) (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s...], 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 1 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 244 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 360 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 65 ms :[(NOT p0), (NOT 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2023-04-07 03:51:41] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-15 finished in 1482 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(((G((p0||X(p1))) U !p0) U (!p2 U p3))))))'
Found a Lengthening insensitive property : CryptoMiner-COL-D20N100-LTLCardinality-01
Stuttering acceptance computed with spot in 431 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:41] [INFO ] Invariant cache hit.
[2023-04-07 03:51:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 03:51:42] [INFO ] Invariant cache hit.
[2023-04-07 03:51:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-07 03:51:42] [INFO ] Invariant cache hit.
[2023-04-07 03:51:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 102 ms. Remains : 63/63 places, 63/63 transitions.
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 377 ms.
Product exploration explored 100000 steps with 0 reset in 430 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 11 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), p0, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10013 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 03:51:43] [INFO ] Invariant cache hit.
[2023-04-07 03:51:43] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 03:51:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-04-07 03:51:43] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), true, (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (G (NOT (AND p0 p2 (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p3)), (F (AND p2 (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 357 ms. Reduced automaton from 11 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 346 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:44] [INFO ] Invariant cache hit.
[2023-04-07 03:51:44] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 03:51:44] [INFO ] Invariant cache hit.
[2023-04-07 03:51:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:44] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-04-07 03:51:44] [INFO ] Invariant cache hit.
[2023-04-07 03:51:44] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2012 ) properties (out of 7) seen :5
Finished Best-First random walk after 4002 steps, including 1 resets, run visited all 2 properties in 6 ms. (steps per millisecond=667 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p0 (NOT p2) p1), true, (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (AND p0 (NOT p3)))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 315 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 290 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 290 ms.
Product exploration explored 100000 steps with 0 reset in 237 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 301 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), true, (AND (NOT p3) (NOT p1))]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:47] [INFO ] Invariant cache hit.
[2023-04-07 03:51:47] [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 48 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:47] [INFO ] Invariant cache hit.
[2023-04-07 03:51:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 03:51:47] [INFO ] Invariant cache hit.
[2023-04-07 03:51:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 03:51:47] [INFO ] Invariant cache hit.
[2023-04-07 03:51:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-01 finished in 6157 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((X(!p1)||p0))) U G(p2)))'
Found a Lengthening insensitive property : CryptoMiner-COL-D20N100-LTLCardinality-13
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0)), p1, true, (AND (NOT p2) p1), (NOT p2)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:47] [INFO ] Invariant cache hit.
[2023-04-07 03:51:47] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 03:51:47] [INFO ] Invariant cache hit.
[2023-04-07 03:51:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 03:51:47] [INFO ] Invariant cache hit.
[2023-04-07 03:51:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 96 ms. Remains : 63/63 places, 63/63 transitions.
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 226 ms.
Product exploration explored 100000 steps with 0 reset in 274 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 235 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0)), p1, true, (AND (NOT p2) p1), (NOT p2)]
Incomplete random walk after 10086 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1260 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 03:51:49] [INFO ] Invariant cache hit.
[2023-04-07 03:51:49] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 03:51:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-04-07 03:51:49] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND p2 p1))), (F (NOT p2)), (F p0)]
Knowledge based reduction with 12 factoid took 438 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:50] [INFO ] Invariant cache hit.
[2023-04-07 03:51:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 03:51:50] [INFO ] Invariant cache hit.
[2023-04-07 03:51:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:50] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 03:51:50] [INFO ] Invariant cache hit.
[2023-04-07 03:51:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Finished random walk after 101 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 238 ms.
Product exploration explored 100000 steps with 0 reset in 257 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 03:51:52] [INFO ] Invariant cache hit.
[2023-04-07 03:51:52] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:52] [INFO ] Invariant cache hit.
[2023-04-07 03:51:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 03:51:52] [INFO ] Invariant cache hit.
[2023-04-07 03:51:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:52] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 03:51:52] [INFO ] Invariant cache hit.
[2023-04-07 03:51:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 63/63 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-13 finished in 4800 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||X(p1)))))'
Found a Lengthening insensitive property : CryptoMiner-COL-D20N100-LTLCardinality-14
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 03:51:52] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 03:51:52] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 03:51:52] [INFO ] Invariant cache hit.
[2023-04-07 03:51:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:52] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-04-07 03:51:52] [INFO ] Invariant cache hit.
[2023-04-07 03:51:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 129 ms. Remains : 62/63 places, 63/63 transitions.
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 279 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 152 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6832 steps, including 2 resets, run visited all 5 properties in 9 ms. (steps per millisecond=759 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 352 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 42 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:53] [INFO ] Invariant cache hit.
[2023-04-07 03:51:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 03:51:53] [INFO ] Invariant cache hit.
[2023-04-07 03:51:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 03:51:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:53] [INFO ] Invariant cache hit.
[2023-04-07 03:51:54] [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 109 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 121 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2669 steps, including 1 resets, run visited all 5 properties in 2 ms. (steps per millisecond=1334 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 341 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 297 ms.
Product exploration explored 100000 steps with 0 reset in 313 ms.
Support contains 42 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 03:51:55] [INFO ] Invariant cache hit.
[2023-04-07 03:51:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 03:51:55] [INFO ] Invariant cache hit.
[2023-04-07 03:51:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:51:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-04-07 03:51:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:51:55] [INFO ] Invariant cache hit.
[2023-04-07 03:51:55] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 62/62 places, 63/63 transitions.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-14 finished in 3060 ms.
[2023-04-07 03:51:55] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:51:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-04-07 03:51:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 63 transitions and 187 arcs took 1 ms.
Total runtime 42214 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-COL-D20N100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1680839576757

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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: LAUNCH task # 7 (type EXCL) for 6 CryptoMiner-COL-D20N100-LTLCardinality-14
lola: time limit : 1200 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-COL-D20N100-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1200 11/32 CryptoMiner-COL-D20N100-LTLCardinality-14 1449641 m, 289928 m/sec, 5620127 t fired, .

Time elapsed: 5 secs. Pages in use: 11
# 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-COL-D20N100-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1200 21/32 CryptoMiner-COL-D20N100-LTLCardinality-14 2727577 m, 255587 m/sec, 11045783 t fired, .

Time elapsed: 10 secs. Pages in use: 21
# 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-COL-D20N100-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1200 30/32 CryptoMiner-COL-D20N100-LTLCardinality-14 3962996 m, 247083 m/sec, 16396464 t fired, .

Time elapsed: 15 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for CryptoMiner-COL-D20N100-LTLCardinality-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-COL-D20N100-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 0 0 1 0 1 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 # 4 (type EXCL) for 3 CryptoMiner-COL-D20N100-LTLCardinality-13
lola: time limit : 1790 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-COL-D20N100-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1790 12/32 CryptoMiner-COL-D20N100-LTLCardinality-13 1488819 m, 297763 m/sec, 5781186 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# 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-COL-D20N100-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1790 21/32 CryptoMiner-COL-D20N100-LTLCardinality-13 2772733 m, 256782 m/sec, 11243103 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# 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-COL-D20N100-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1790 31/32 CryptoMiner-COL-D20N100-LTLCardinality-13 3990320 m, 243517 m/sec, 16520020 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for CryptoMiner-COL-D20N100-LTLCardinality-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-COL-D20N100-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 CryptoMiner-COL-D20N100-LTLCardinality-01
lola: time limit : 3560 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-COL-D20N100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3560 10/32 CryptoMiner-COL-D20N100-LTLCardinality-01 1250710 m, 250142 m/sec, 4780923 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# 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-COL-D20N100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3560 18/32 CryptoMiner-COL-D20N100-LTLCardinality-01 2354191 m, 220696 m/sec, 9437778 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# 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-COL-D20N100-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3560 26/32 CryptoMiner-COL-D20N100-LTLCardinality-01 3412283 m, 211618 m/sec, 14001463 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for CryptoMiner-COL-D20N100-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-COL-D20N100-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-COL-D20N100-LTLCardinality-01: LTL unknown AGGR
CryptoMiner-COL-D20N100-LTLCardinality-13: LTL unknown AGGR
CryptoMiner-COL-D20N100-LTLCardinality-14: LTL unknown AGGR


Time elapsed: 60 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-COL-D20N100"
export BK_EXAMINATION="LTLCardinality"
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-COL-D20N100, examination is LTLCardinality"
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-167987244900139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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