Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 24K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 28K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 27K Mar 31 16:48 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D20N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680888196911

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 17:23:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 17:23:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:23:18] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-04-07 17:23:18] [INFO ] Transformed 63 places.
[2023-04-07 17:23:18] [INFO ] Transformed 63 transitions.
[2023-04-07 17:23:18] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 17:23:18] [INFO ] Computed 1 invariants in 12 ms
[2023-04-07 17:23:18] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-04-07 17:23:18] [INFO ] Invariant cache hit.
[2023-04-07 17:23:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:18] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-04-07 17:23:18] [INFO ] Invariant cache hit.
[2023-04-07 17:23:19] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2023-04-07 17:23:19] [INFO ] Flatten gal took : 19 ms
[2023-04-07 17:23:19] [INFO ] Flatten gal took : 8 ms
[2023-04-07 17:23:19] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=115 ) properties (out of 26) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-04-07 17:23:19] [INFO ] Invariant cache hit.
[2023-04-07 17:23:19] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 17:23:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-04-07 17:23:19] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-04-07 17:23:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:19] [INFO ] After 29ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-04-07 17:23:20] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 17:23:20] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 62
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 17 place count 63 transition count 46
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 47 transition count 46
Applied a total of 33 rules in 14 ms. Remains 47 /63 variables (removed 16) and now considering 46/63 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 47/63 places, 46/63 transitions.
Incomplete random walk after 10075 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1679 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 474654 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 474654 steps, saw 202416 distinct states, run finished after 3002 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 46 rows 47 cols
[2023-04-07 17:23:23] [INFO ] Computed 2 invariants in 8 ms
[2023-04-07 17:23:23] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 17:23:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:23:23] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 17:23:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:23] [INFO ] After 22ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 17:23:23] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-07 17:23:23] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 20 ms.
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 47/47 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-04-07 17:23:23] [INFO ] Invariant cache hit.
[2023-04-07 17:23:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-04-07 17:23:23] [INFO ] Invariant cache hit.
[2023-04-07 17:23:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:23] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-04-07 17:23:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:23:23] [INFO ] Invariant cache hit.
[2023-04-07 17:23:23] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 47/47 places, 46/46 transitions.
Graph (complete) has 66 edges and 47 vertex of which 32 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 32 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 29 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 28 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 28 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 24 transition count 24
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 22 place count 24 transition count 19
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 27 place count 19 transition count 19
Applied a total of 27 rules in 7 ms. Remains 19 /47 variables (removed 28) and now considering 19/46 (removed 27) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 19 rows 19 cols
[2023-04-07 17:23:23] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 17:23:23] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 17:23:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 17:23:23] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 17:23:23] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-07 17:23:23] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
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
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 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 17:23:24] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 17:23:24] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 17:23:24] [INFO ] Invariant cache hit.
[2023-04-07 17:23:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 17:23:24] [INFO ] Invariant cache hit.
[2023-04-07 17:23:24] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 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 248 ms :[p0, p0, p0, true]
Running random walk in product with property : CryptoMiner-PT-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 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 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 404 ms.
Product exploration explored 100000 steps with 0 reset in 358 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 85 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 58 ms :[true, 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 204 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=204 )
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 185 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-PT-D20N100-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-00 finished in 1516 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 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:23:25] [INFO ] Invariant cache hit.
[2023-04-07 17:23:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 17:23:25] [INFO ] Invariant cache hit.
[2023-04-07 17:23:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:25] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 17:23:25] [INFO ] Invariant cache hit.
[2023-04-07 17:23:25] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 622 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-PT-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 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], 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 0 reset in 529 ms.
Product exploration explored 100000 steps with 0 reset in 385 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 161 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 457 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 10 ms. (steps per millisecond=1006 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 17:23:28] [INFO ] Invariant cache hit.
[2023-04-07 17:23:28] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 17:23:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 17:23:28] [INFO ] After 24ms 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 (NOT p2) (NOT p3))), (F (AND p2 (NOT p3) (NOT p1))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 446 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 395 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 339 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 17:23:29] [INFO ] Invariant cache hit.
[2023-04-07 17:23:29] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 17:23:29] [INFO ] Invariant cache hit.
[2023-04-07 17:23:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:29] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-04-07 17:23:29] [INFO ] Invariant cache hit.
[2023-04-07 17:23:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 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 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 144 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 347 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 10085 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1680 ) properties (out of 7) seen :5
Finished Best-First random walk after 3344 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=477 )
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 294 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 449 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 350 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 1 reset in 242 ms.
Product exploration explored 100000 steps with 1 reset in 317 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 313 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 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:23:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:23:32] [INFO ] Invariant cache hit.
[2023-04-07 17:23:32] [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 55 ms. Remains : 63/63 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin16948596357098041058
[2023-04-07 17:23:32] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16948596357098041058
Running compilation step : cd /tmp/ltsmin16948596357098041058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 221 ms.
Running link step : cd /tmp/ltsmin16948596357098041058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16948596357098041058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5463639377713106627.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 17:23:47] [INFO ] Invariant cache hit.
[2023-04-07 17:23:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 17:23:47] [INFO ] Invariant cache hit.
[2023-04-07 17:23:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-04-07 17:23:47] [INFO ] Invariant cache hit.
[2023-04-07 17:23:47] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 63/63 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin3456357735318496664
[2023-04-07 17:23:47] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3456357735318496664
Running compilation step : cd /tmp/ltsmin3456357735318496664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 148 ms.
Running link step : cd /tmp/ltsmin3456357735318496664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3456357735318496664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8392245798894970551.hoa' '--buchi-type=spotba'
LTSmin run took 8360 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-01 finished in 30758 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 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:23:56] [INFO ] Invariant cache hit.
[2023-04-07 17:23:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 17:23:56] [INFO ] Invariant cache hit.
[2023-04-07 17:23:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:56] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-04-07 17:23:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:23:56] [INFO ] Invariant cache hit.
[2023-04-07 17:23:56] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-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 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 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 423 ms.
Product exploration explored 100000 steps with 0 reset in 416 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 (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 112 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 132 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1006 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:23:57] [INFO ] Invariant cache hit.
[2023-04-07 17:23:57] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:23:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 17:23:57] [INFO ] After 24ms 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 (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND 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 156 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-PT-D20N100-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-02 finished in 1630 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 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 17:23:58] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 17:23:58] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 17:23:58] [INFO ] Invariant cache hit.
[2023-04-07 17:23:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-04-07 17:23:58] [INFO ] Invariant cache hit.
[2023-04-07 17:23:58] [INFO ] Dead Transitions using invariants and state equation in 40 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 124 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-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 148 ms.
Product exploration explored 100000 steps with 0 reset in 197 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 70 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 26 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 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-04-07 17:23:59] [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 109 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-PT-D20N100-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-03 finished in 1024 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 2 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 17:23:59] [INFO ] Computed 1 invariants in 2 ms
[2023-04-07 17:23:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 17:23:59] [INFO ] Invariant cache hit.
[2023-04-07 17:23:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:23:59] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 17:23:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:23:59] [INFO ] Invariant cache hit.
[2023-04-07 17:23:59] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 110 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-PT-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 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 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 229 ms.
Product exploration explored 100000 steps with 0 reset in 330 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.4 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 p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 127 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 114 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=559 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:24:00] [INFO ] Invariant cache hit.
[2023-04-07 17:24:00] [INFO ] After 26ms 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 p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (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 220 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-04-07 17:24:00] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (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 227 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-PT-D20N100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-05 finished in 1725 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 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:24:00] [INFO ] Invariant cache hit.
[2023-04-07 17:24:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 17:24:00] [INFO ] Invariant cache hit.
[2023-04-07 17:24:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-04-07 17:24:00] [INFO ] Invariant cache hit.
[2023-04-07 17:24:01] [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.
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-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 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], 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 3 reset in 173 ms.
Product exploration explored 100000 steps with 0 reset in 209 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.6 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 110 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 26 ms :[p0]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2516 ) 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 143 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 :[p0]
Stuttering acceptance computed with spot in 40 ms :[p0]
[2023-04-07 17:24:01] [INFO ] Invariant cache hit.
[2023-04-07 17:24:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 17:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 17:24:01] [INFO ] [Real]Absence check using state equation in 36 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 139 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-PT-D20N100-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-06 finished in 1217 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&&F(G(!p0)))))'
Support contains 2 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 4 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 17:24:02] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 17:24:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 17:24:02] [INFO ] Invariant cache hit.
[2023-04-07 17:24:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:02] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-04-07 17:24:02] [INFO ] Invariant cache hit.
[2023-04-07 17:24:02] [INFO ] Dead Transitions using invariants and state equation in 35 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 122 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, true, true, p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s31 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-08 finished in 271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1&&X(p2)))||G(p3))))'
Support contains 7 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 17:24:02] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 17:24:02] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-04-07 17:24:02] [INFO ] Invariant cache hit.
[2023-04-07 17:24:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:02] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-04-07 17:24:02] [INFO ] Invariant cache hit.
[2023-04-07 17:24:02] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p3 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 5}]], initial=0, aps=[p0:(GT s17 s55), p3:(LEQ s52 s3), p1:(LEQ s21 s58), p2:(LEQ s33 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 245 steps with 11 reset in 1 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-10 finished in 426 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 1 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 17:24:02] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 17:24:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 17:24:02] [INFO ] Invariant cache hit.
[2023-04-07 17:24:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:02] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-04-07 17:24:02] [INFO ] Invariant cache hit.
[2023-04-07 17:24:02] [INFO ] Dead Transitions using invariants and state equation in 37 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 119 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s39)], 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 134 ms.
Product exploration explored 100000 steps with 0 reset in 283 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/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 74 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 42 ms :[(NOT p0)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2516 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2419451 steps, run timeout after 3001 ms. (steps per millisecond=806 ) properties seen :{}
Probabilistic random walk after 2419451 steps, saw 1221380 distinct states, run finished after 3001 ms. (steps per millisecond=806 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:24:06] [INFO ] Invariant cache hit.
[2023-04-07 17:24:06] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 17:24:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:06] [INFO ] After 11ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 17:24:06] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 17:24:06] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 41 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 4 ms
Free SCC test removed 20 places
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 79 edges and 42 vertex of which 18 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 18 transition count 17
Applied a total of 15 rules in 7 ms. Remains 18 /62 variables (removed 44) and now considering 17/63 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 18/62 places, 17/63 transitions.
Incomplete random walk after 10088 steps, including 167 resets, run finished after 3 ms. (steps per millisecond=3362 ) properties (out of 1) seen :0
Finished Best-First random walk after 1600 steps, including 93 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1600 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 194 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-04-07 17:24:06] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (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 4 factoid took 140 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-PT-D20N100-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-11 finished in 4306 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||X(X(F(p1)))))))'
Support contains 4 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 4 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:24:07] [INFO ] Invariant cache hit.
[2023-04-07 17:24:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 17:24:07] [INFO ] Invariant cache hit.
[2023-04-07 17:24:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:07] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-04-07 17:24:07] [INFO ] Invariant cache hit.
[2023-04-07 17:24:07] [INFO ] Dead Transitions using invariants and state equation in 42 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 125 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s44 s9), p1:(LEQ s33 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20083 reset in 122 ms.
Product exploration explored 100000 steps with 19955 reset in 94 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
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2516 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:24:07] [INFO ] Invariant cache hit.
[2023-04-07 17:24:07] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:24:07] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:24:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:07] [INFO ] After 9ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:24:07] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 17:24:07] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 62
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 19 place count 62 transition count 44
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 44 transition count 44
Applied a total of 37 rules in 7 ms. Remains 44 /62 variables (removed 18) and now considering 44/63 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 44/62 places, 44/63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2525004 steps, run visited all 1 properties in 1656 ms. (steps per millisecond=1524 )
Probabilistic random walk after 2525004 steps, saw 530903 distinct states, run finished after 1656 ms. (steps per millisecond=1524 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in 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 17:24:10] [INFO ] Invariant cache hit.
[2023-04-07 17:24:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 17:24:10] [INFO ] Invariant cache hit.
[2023-04-07 17:24:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:10] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 17:24:10] [INFO ] Invariant cache hit.
[2023-04-07 17:24:10] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 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
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:24:10] [INFO ] Invariant cache hit.
[2023-04-07 17:24:10] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:24:10] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:24:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:10] [INFO ] After 4ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:24:10] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 17:24:10] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 62
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 19 place count 62 transition count 44
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 44 transition count 44
Applied a total of 37 rules in 6 ms. Remains 44 /62 variables (removed 18) and now considering 44/63 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 44/62 places, 44/63 transitions.
Incomplete random walk after 10061 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5030 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2525004 steps, run visited all 1 properties in 1712 ms. (steps per millisecond=1474 )
Probabilistic random walk after 2525004 steps, saw 530903 distinct states, run finished after 1713 ms. (steps per millisecond=1474 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 19887 reset in 78 ms.
Product exploration explored 100000 steps with 19957 reset in 82 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 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 17:24:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:24:13] [INFO ] Invariant cache hit.
[2023-04-07 17:24:13] [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 46 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin12120596373791706833
[2023-04-07 17:24:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12120596373791706833
Running compilation step : cd /tmp/ltsmin12120596373791706833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 128 ms.
Running link step : cd /tmp/ltsmin12120596373791706833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12120596373791706833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11909258691079866148.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:24:28] [INFO ] Invariant cache hit.
[2023-04-07 17:24:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 17:24:28] [INFO ] Invariant cache hit.
[2023-04-07 17:24:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:24:28] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-04-07 17:24:28] [INFO ] Invariant cache hit.
[2023-04-07 17:24:28] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin11490071661999793410
[2023-04-07 17:24:28] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11490071661999793410
Running compilation step : cd /tmp/ltsmin11490071661999793410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin11490071661999793410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11490071661999793410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16670872465582390596.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 17:24:43] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:24:43] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:24:43] [INFO ] Time to serialize gal into /tmp/LTL4649881781636838923.gal : 1 ms
[2023-04-07 17:24:43] [INFO ] Time to serialize properties into /tmp/LTL12899376932553688929.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4649881781636838923.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4943711691465940517.hoa' '-atoms' '/tmp/LTL12899376932553688929.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12899376932553688929.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4943711691465940517.hoa
Detected timeout of ITS tools.
[2023-04-07 17:24:58] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:24:58] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:24:58] [INFO ] Time to serialize gal into /tmp/LTL16254985588810169583.gal : 2 ms
[2023-04-07 17:24:58] [INFO ] Time to serialize properties into /tmp/LTL5778723889262677937.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16254985588810169583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5778723889262677937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(state_c11>capacity_c17)")||(X(X(F("(resource_c20<=capacity_c15)"))))))))
Formula 0 simplified : XF(!"(state_c11>capacity_c17)" & XXG!"(resource_c20<=capacity_c15)")
Detected timeout of ITS tools.
[2023-04-07 17:25:13] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:25:13] [INFO ] Applying decomposition
[2023-04-07 17:25:13] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10565704273532614480.txt' '-o' '/tmp/graph10565704273532614480.bin' '-w' '/tmp/graph10565704273532614480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10565704273532614480.bin' '-l' '-1' '-v' '-w' '/tmp/graph10565704273532614480.weights' '-q' '0' '-e' '0.001'
[2023-04-07 17:25:13] [INFO ] Decomposing Gal with order
[2023-04-07 17:25:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 17:25:13] [INFO ] Removed a total of 9 redundant transitions.
[2023-04-07 17:25:13] [INFO ] Flatten gal took : 62 ms
[2023-04-07 17:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-04-07 17:25:13] [INFO ] Time to serialize gal into /tmp/LTL16473358416752879556.gal : 7 ms
[2023-04-07 17:25:14] [INFO ] Time to serialize properties into /tmp/LTL5051702071367723818.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16473358416752879556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5051702071367723818.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu3.state_c11>gu3.capacity_c17)")||(X(X(F("(gu12.resource_c20<=gu12.capacity_c15)"))))))))
Formula 0 simplified : XF(!"(gu3.state_c11>gu3.capacity_c17)" & XXG!"(gu12.resource_c20<=gu12.capacity_c15)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4362861331704040169
[2023-04-07 17:25:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4362861331704040169
Running compilation step : cd /tmp/ltsmin4362861331704040169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin4362861331704040169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin4362861331704040169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-12 finished in 97047 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 U (G(p1)||X(!p0))))))'
Support contains 3 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 3 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:25:44] [INFO ] Invariant cache hit.
[2023-04-07 17:25:44] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-04-07 17:25:44] [INFO ] Invariant cache hit.
[2023-04-07 17:25:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:25:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-04-07 17:25:44] [INFO ] Invariant cache hit.
[2023-04-07 17:25:44] [INFO ] Dead Transitions using invariants and state equation in 36 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 143 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s21 s54), p0:(LEQ 1 s29)], 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 24886 reset in 86 ms.
Product exploration explored 100000 steps with 25027 reset in 85 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 7 factoid took 341 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0), true, (NOT p1)]
Incomplete random walk after 10060 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=591 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 17:25:45] [INFO ] Invariant cache hit.
[2023-04-07 17:25:45] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 17:25:45] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 17:25:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:25:45] [INFO ] After 12ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 17:25:45] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-07 17:25:45] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 40 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 79 edges and 42 vertex of which 39 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 3 ms. Remains 39 /62 variables (removed 23) and now considering 42/63 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 39/62 places, 42/63 transitions.
Incomplete random walk after 10030 steps, including 84 resets, run finished after 36 ms. (steps per millisecond=278 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 223 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 255 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Finished probabilistic random walk after 24896 steps, run visited all 3 properties in 115 ms. (steps per millisecond=216 )
Probabilistic random walk after 24896 steps, saw 10047 distinct states, run finished after 115 ms. (steps per millisecond=216 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p1 p0)), (F p0), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p0))
Knowledge based reduction with 7 factoid took 514 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-13 finished in 2266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 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.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:25:46] [INFO ] Invariant cache hit.
[2023-04-07 17:25:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 17:25:46] [INFO ] Invariant cache hit.
[2023-04-07 17:25:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:25:46] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 17:25:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:25:46] [INFO ] Invariant cache hit.
[2023-04-07 17:25:46] [INFO ] Dead Transitions using invariants and state equation in 35 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 130 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s34 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 162 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 based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2568768 steps, run timeout after 3001 ms. (steps per millisecond=855 ) properties seen :{}
Probabilistic random walk after 2568768 steps, saw 1291808 distinct states, run finished after 3001 ms. (steps per millisecond=855 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:25:50] [INFO ] Invariant cache hit.
[2023-04-07 17:25:50] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:25:50] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:25:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:25:50] [INFO ] After 4ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:25:50] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 17:25:50] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 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 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-04-07 17:25:50] [INFO ] Invariant cache hit.
[2023-04-07 17:25:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 17:25:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-04-07 17:25:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 17:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 17:25:50] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-04-07 17:25:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:25:50] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2023-04-07 17:25:50] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-04-07 17:25:50] [INFO ] Added : 57 causal constraints over 12 iterations in 115 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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 4 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-04-07 17:25:50] [INFO ] Invariant cache hit.
[2023-04-07 17:25:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 17:25:50] [INFO ] Invariant cache hit.
[2023-04-07 17:25:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:25:50] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-04-07 17:25:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:25:50] [INFO ] Invariant cache hit.
[2023-04-07 17:25:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 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.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 based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10063 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2515 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2915375 steps, run timeout after 3001 ms. (steps per millisecond=971 ) properties seen :{}
Probabilistic random walk after 2915375 steps, saw 1455313 distinct states, run finished after 3001 ms. (steps per millisecond=971 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 17:25:53] [INFO ] Invariant cache hit.
[2023-04-07 17:25:53] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 17:25:53] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 17:25:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:25:53] [INFO ] After 8ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 17:25:53] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 17:25:53] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (complete) has 100 edges and 62 vertex of which 48 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 48 transition count 42
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 22 place count 42 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 41 transition count 41
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 35 place count 41 transition count 29
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 47 place count 29 transition count 29
Applied a total of 47 rules in 6 ms. Remains 29 /62 variables (removed 33) and now considering 29/63 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 29/62 places, 29/63 transitions.
Incomplete random walk after 10042 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5021 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5638 steps, run visited all 1 properties in 6 ms. (steps per millisecond=939 )
Probabilistic random walk after 5638 steps, saw 1719 distinct states, run finished after 6 ms. (steps per millisecond=939 ) properties seen :1
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 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-04-07 17:25:54] [INFO ] Invariant cache hit.
[2023-04-07 17:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 17:25:54] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-04-07 17:25:54] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 17:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 17:25:54] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-04-07 17:25:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:25:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2023-04-07 17:25:54] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-07 17:25:54] [INFO ] Added : 57 causal constraints over 12 iterations in 120 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
Built C files in :
/tmp/ltsmin3482938246377246983
[2023-04-07 17:25:54] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2023-04-07 17:25:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:25:54] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2023-04-07 17:25:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:25:54] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2023-04-07 17:25:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:25:54] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3482938246377246983
Running compilation step : cd /tmp/ltsmin3482938246377246983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin3482938246377246983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin3482938246377246983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12834062890093922633.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-14 finished in 8717 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||F(p1)))))'
Support contains 2 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 41 edges and 63 vertex of which 21 / 63 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 145 edges and 43 vertex of which 42 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 2 rules in 2 ms. Remains 42 /63 variables (removed 21) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2023-04-07 17:25:55] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 17:25:55] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 17:25:55] [INFO ] Invariant cache hit.
[2023-04-07 17:25:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:25:55] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 17:25:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 17:25:55] [INFO ] Invariant cache hit.
[2023-04-07 17:25:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/63 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 42/63 places, 43/63 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s5), p1:(LEQ 3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-15 finished in 176 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||X(X(F(p1)))))))'
[2023-04-07 17:25:55] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14436998284667432707
[2023-04-07 17:25:55] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2023-04-07 17:25:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:25:55] [INFO ] Applying decomposition
[2023-04-07 17:25:55] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2023-04-07 17:25:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:25:55] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2023-04-07 17:25:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 17:25:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14436998284667432707
Running compilation step : cd /tmp/ltsmin14436998284667432707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-04-07 17:25:55] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2358220403669423094.txt' '-o' '/tmp/graph2358220403669423094.bin' '-w' '/tmp/graph2358220403669423094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2358220403669423094.bin' '-l' '-1' '-v' '-w' '/tmp/graph2358220403669423094.weights' '-q' '0' '-e' '0.001'
[2023-04-07 17:25:55] [INFO ] Decomposing Gal with order
[2023-04-07 17:25:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 17:25:55] [INFO ] Removed a total of 9 redundant transitions.
[2023-04-07 17:25:55] [INFO ] Flatten gal took : 7 ms
[2023-04-07 17:25:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-07 17:25:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality6401697687177736125.gal : 3 ms
[2023-04-07 17:25:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality8946167876741168399.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6401697687177736125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8946167876741168399.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gu18.state_c11>gu18.capacity_c17)")||(X(X(F("(gu4.resource_c20<=gu4.capacity_c15)"))))))))
Formula 0 simplified : XF(!"(gu18.state_c11>gu18.capacity_c17)" & XXG!"(gu4.resource_c20<=gu4.capacity_c15)")
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin14436998284667432707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14436998284667432707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi2.gi1.gu17.t22, gi2.gi1.gu17.t23, gi2.gi1.gu22.t35, gi2.gi1.gu24.t37, gi2.gi1.t34, gi2.gi1....473
Computing Next relation with stutter on 1.07042e+08 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: LTL layer: formula: X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.015: "X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.015: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.113: DFS-FIFO for weak LTL, using special progress label 66
pins2lts-mc-linux64( 0/ 8), 0.113: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.113: State length is 64, there are 68 groups
pins2lts-mc-linux64( 0/ 8), 0.113: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.113: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.113: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.113: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.140: ~2 levels ~960 states ~2288 transitions
pins2lts-mc-linux64( 0/ 8), 0.310: ~2 levels ~1920 states ~4824 transitions
pins2lts-mc-linux64( 5/ 8), 0.361: ~2 levels ~3840 states ~12464 transitions
pins2lts-mc-linux64( 6/ 8), 0.436: ~2 levels ~7680 states ~27640 transitions
pins2lts-mc-linux64( 6/ 8), 0.551: ~2 levels ~15360 states ~58168 transitions
pins2lts-mc-linux64( 1/ 8), 0.965: ~2 levels ~30720 states ~102728 transitions
pins2lts-mc-linux64( 5/ 8), 1.786: ~2 levels ~61440 states ~250048 transitions
pins2lts-mc-linux64( 6/ 8), 2.552: ~2 levels ~122880 states ~582496 transitions
pins2lts-mc-linux64( 5/ 8), 4.008: ~2 levels ~245760 states ~1090712 transitions
pins2lts-mc-linux64( 0/ 8), 5.422: ~2 levels ~491520 states ~1785320 transitions
pins2lts-mc-linux64( 0/ 8), 6.872: ~2 levels ~983040 states ~3637656 transitions
pins2lts-mc-linux64( 0/ 8), 9.988: ~2 levels ~1966080 states ~7744224 transitions
pins2lts-mc-linux64( 0/ 8), 13.290: ~2 levels ~3932160 states ~16241576 transitions
pins2lts-mc-linux64( 0/ 8), 19.983: ~2 levels ~7864320 states ~33081192 transitions
pins2lts-mc-linux64( 0/ 8), 32.983: ~2 levels ~15728640 states ~67563672 transitions
pins2lts-mc-linux64( 0/ 8), 60.675: ~2 levels ~31457280 states ~141787280 transitions
pins2lts-mc-linux64( 0/ 8), 119.240: ~2 levels ~62914560 states ~297232472 transitions
pins2lts-mc-linux64( 0/ 8), 236.146: ~2 levels ~125829120 states ~598495808 transitions
pins2lts-mc-linux64( 7/ 8), 283.150: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 283.203:
pins2lts-mc-linux64( 0/ 8), 283.203: mean standard work distribution: 10.0% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 283.203:
pins2lts-mc-linux64( 0/ 8), 283.203: Explored 117269492 states 698053588 transitions, fanout: 5.953
pins2lts-mc-linux64( 0/ 8), 283.203: Total exploration time 283.050 sec (282.990 sec minimum, 283.020 sec on average)
pins2lts-mc-linux64( 0/ 8), 283.203: States per second: 414307, Transitions per second: 2466185
pins2lts-mc-linux64( 0/ 8), 283.203:
pins2lts-mc-linux64( 0/ 8), 283.203: Progress states detected: 89468389
pins2lts-mc-linux64( 0/ 8), 283.203: Redundant explorations: -12.6272
pins2lts-mc-linux64( 0/ 8), 283.203:
pins2lts-mc-linux64( 0/ 8), 283.203: Queue width: 8B, total height: 31602129, memory: 241.11MB
pins2lts-mc-linux64( 0/ 8), 283.203: Tree memory: 1200.9MB, 9.4 B/state, compr.: 3.6%
pins2lts-mc-linux64( 0/ 8), 283.203: Tree fill ratio (roots/leafs): 99.0%/69.0%
pins2lts-mc-linux64( 0/ 8), 283.203: Stored 63 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 283.203: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 283.203: Est. total memory use: 1442.0MB (~1265.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14436998284667432707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14436998284667432707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-04-07 17:46:47] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:46:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality10986809861136095661.gal : 1 ms
[2023-04-07 17:46:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality10094987532196844524.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10986809861136095661.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10094987532196844524.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(G(("(state_c11>capacity_c17)")||(X(X(F("(resource_c20<=capacity_c15)"))))))))
Formula 0 simplified : XF(!"(state_c11>capacity_c17)" & XXG!"(resource_c20<=capacity_c15)")
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39...265
Computing Next relation with stutter on 1.07042e+08 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
116627 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1166.29,3600584,1,0,2153,2.16143e+07,18,1428,2472,2.03323e+07,3577
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2595310 ms.

BK_STOP 1680890794696

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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