About the Execution of ITS-Tools for CryptoMiner-PT-D03N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 483.928 | 16587.00 | 31356.00 | 291.80 | FFTTFFFFFFFTFFFF | normal |
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-167987243500163.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-D03N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243500163
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.3K Mar 31 16:48 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D03N100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1680876016974
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-D03N100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 14:00: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 14:00:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 14:00:18] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 14:00:18] [INFO ] Transformed 12 places.
[2023-04-07 14:00:18] [INFO ] Transformed 12 transitions.
[2023-04-07 14:00:18] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 14:00:18] [INFO ] Computed 1 invariants in 6 ms
[2023-04-07 14:00:18] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-04-07 14:00:18] [INFO ] Invariant cache hit.
[2023-04-07 14:00:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:18] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-04-07 14:00:18] [INFO ] Invariant cache hit.
[2023-04-07 14:00:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 14:00:19] [INFO ] Flatten gal took : 13 ms
[2023-04-07 14:00:19] [INFO ] Flatten gal took : 4 ms
[2023-04-07 14:00:19] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 25) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-04-07 14:00:19] [INFO ] Invariant cache hit.
[2023-04-07 14:00:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 14:00:19] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 14:00:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 14:00:19] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-04-07 14:00:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:19] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-04-07 14:00:19] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 14:00:19] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 183 steps, including 3 resets, run visited all 2 properties in 3 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 3 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 14 edges and 9 vertex of which 8 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 2 rules in 6 ms. Remains 8 /12 variables (removed 4) and now considering 7/12 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 8/12 places, 7/12 transitions.
Incomplete random walk after 10044 steps, including 188 resets, run finished after 4 ms. (steps per millisecond=2511 ) properties (out of 1) seen :0
Finished Best-First random walk after 88 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=88 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 14:00:20] [INFO ] Computed 0 invariants in 3 ms
[2023-04-07 14:00:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 14:00:20] [INFO ] Invariant cache hit.
[2023-04-07 14:00:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:20] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 14:00:20] [INFO ] Invariant cache hit.
[2023-04-07 14:00:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 11/12 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 1 (ADD s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6808 reset in 230 ms.
Stack based approach found an accepted trace after 74 steps with 4 reset with depth 14 and stack size 14 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-01 finished in 596 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((X(X(F(p1)))||p0))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 14:00:20] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 14:00:20] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 14:00:20] [INFO ] Invariant cache hit.
[2023-04-07 14:00:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 14:00:20] [INFO ] Invariant cache hit.
[2023-04-07 14:00:20] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)) (LEQ 3 (ADD s8 s9 s10 s11))), p1:(LEQ 3 (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/12 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 37 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-03 finished in 671 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(p1)&&p0) U (!p2 U (G(!p2)||(!p2&&(p3||G(!p1)))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 14:00:21] [INFO ] Invariant cache hit.
[2023-04-07 14:00:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 14:00:21] [INFO ] Invariant cache hit.
[2023-04-07 14:00:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:21] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-04-07 14:00:21] [INFO ] Invariant cache hit.
[2023-04-07 14:00:21] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 385 ms :[p2, true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), p2, (AND p1 p2), false, (AND p1 p2), (AND p0 (NOT p1) p2), p1, false]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0)), acceptance={} source=2 dest: 1}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={0} source=6 dest: 0}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 4}], [{ cond=p1, acceptance={} source=8 dest: 1}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0)), acceptance={} source=9 dest: 8}]], initial=0, aps=[p3:(GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7)), p1:(LEQ 2 (ADD s0 s1 s2 s3)), p2:(LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)), p0:(AND (LEQ (ADD s4 s5 s6 s7) (A...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33349 reset in 286 ms.
Stack based approach found an accepted trace after 21 steps with 5 reset with depth 6 and stack size 6 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-04 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0))&&F(p1))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 14:00:22] [INFO ] Invariant cache hit.
[2023-04-07 14:00:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-04-07 14:00:22] [INFO ] Invariant cache hit.
[2023-04-07 14:00:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:22] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-04-07 14:00:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 14:00:22] [INFO ] Invariant cache hit.
[2023-04-07 14:00:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)), p1:(OR (LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)) (AND (LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)) (GT (ADD s0 ...], 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 63 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-05 finished in 538 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 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 14:00:22] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 14:00:22] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 14:00:22] [INFO ] Invariant cache hit.
[2023-04-07 14:00:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:22] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-04-07 14:00:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:00:22] [INFO ] Invariant cache hit.
[2023-04-07 14:00:22] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-06 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 (ADD s0 s1 s2 s3) (ADD s7 s8 s9 s10))], 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 70 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 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 31 ms :[(NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 8 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 14:00:23] [INFO ] Invariant cache hit.
[2023-04-07 14:00:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 14:00:23] [INFO ] Invariant cache hit.
[2023-04-07 14:00:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 14:00:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 14:00:23] [INFO ] Invariant cache hit.
[2023-04-07 14:00:23] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 46 ms :[(NOT p0)]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1001 ) properties (out of 1) seen :0
Finished Best-First random walk after 396 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=396 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 70 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Built C files in :
/tmp/ltsmin4197275810085973334
[2023-04-07 14:00:24] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2023-04-07 14:00:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 14:00:24] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2023-04-07 14:00:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 14:00:24] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2023-04-07 14:00:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 14:00:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4197275810085973334
Running compilation step : cd /tmp/ltsmin4197275810085973334;'/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 158 ms.
Running link step : cd /tmp/ltsmin4197275810085973334;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4197275810085973334;'/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/stateBased14765943433161126311.hoa' '--buchi-type=spotba'
LTSmin run took 271 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-06 finished in 1831 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) U G((!p1&&X(!p0))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 14:00:24] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 14:00:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 14:00:24] [INFO ] Invariant cache hit.
[2023-04-07 14:00:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:24] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-04-07 14:00:24] [INFO ] Invariant cache hit.
[2023-04-07 14:00:24] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), p0]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)), p0:(LEQ 3 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-07 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 26 edges and 9 vertex of which 8 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 2 rules in 2 ms. Remains 8 /12 variables (removed 4) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-04-07 14:00:24] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 14:00:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 14:00:24] [INFO ] Invariant cache hit.
[2023-04-07 14:00:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:25] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-04-07 14:00:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:00:25] [INFO ] Invariant cache hit.
[2023-04-07 14:00:25] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 8/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 65 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 23 edges and 8 vertex of which 1 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/8 stabilizing places and 8/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 290 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-07 14:00:26] [INFO ] Invariant cache hit.
[2023-04-07 14:00:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 14:00:26] [INFO ] Invariant cache hit.
[2023-04-07 14:00:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 14:00:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 14:00:26] [INFO ] Invariant cache hit.
[2023-04-07 14:00:26] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 8/8 places, 9/9 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 23 edges and 8 vertex of which 1 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/8 stabilizing places and 8/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 40 ms.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-08 finished in 1865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1)))||F(p1))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 14:00:26] [INFO ] Computed 1 invariants in 14 ms
[2023-04-07 14:00:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-04-07 14:00:26] [INFO ] Invariant cache hit.
[2023-04-07 14:00:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:26] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-04-07 14:00:26] [INFO ] Invariant cache hit.
[2023-04-07 14:00:26] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s9 s3), p0:(LEQ s4 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28 reset in 65 ms.
Product exploration explored 100000 steps with 32 reset in 94 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 14:00:27] [INFO ] Invariant cache hit.
[2023-04-07 14:00:27] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 14:00:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-04-07 14:00:28] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 14:00:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:28] [INFO ] After 2ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 14:00:28] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 14:00:28] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 157 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=78 )
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 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 12 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 12 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 10 transition count 9
Applied a total of 5 rules in 6 ms. Remains 10 /12 variables (removed 2) and now considering 9/12 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 10/12 places, 9/12 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2298 steps, run visited all 1 properties in 30 ms. (steps per millisecond=76 )
Probabilistic random walk after 2298 steps, saw 1001 distinct states, run finished after 30 ms. (steps per millisecond=76 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 545 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 14:00:29] [INFO ] Invariant cache hit.
[2023-04-07 14:00:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 14:00:29] [INFO ] Invariant cache hit.
[2023-04-07 14:00:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:29] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 14:00:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:00:29] [INFO ] Invariant cache hit.
[2023-04-07 14:00:29] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 364 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10018 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=5009 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 14:00:29] [INFO ] Invariant cache hit.
[2023-04-07 14:00:29] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 14:00:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 14:00:29] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 14:00:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:29] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 14:00:29] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 14:00:29] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 160 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=160 )
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 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 12 transition count 11
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 12 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 10 transition count 9
Applied a total of 5 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/12 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/12 places, 9/12 transitions.
Incomplete random walk after 10020 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=3340 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2298 steps, run visited all 1 properties in 5 ms. (steps per millisecond=459 )
Probabilistic random walk after 2298 steps, saw 1001 distinct states, run finished after 5 ms. (steps per millisecond=459 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 442 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 12 reset in 60 ms.
Product exploration explored 100000 steps with 21 reset in 131 ms.
Built C files in :
/tmp/ltsmin12257495556459030870
[2023-04-07 14:00:31] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2023-04-07 14:00:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 14:00:31] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2023-04-07 14:00:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 14:00:31] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2023-04-07 14:00:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 14:00:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12257495556459030870
Running compilation step : cd /tmp/ltsmin12257495556459030870;'/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 77 ms.
Running link step : cd /tmp/ltsmin12257495556459030870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin12257495556459030870;'/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/stateBased6414317214350217727.hoa' '--buchi-type=spotba'
LTSmin run took 161 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-09 finished in 4534 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(F(p1))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 14:00:31] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 14:00:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 14:00:31] [INFO ] Invariant cache hit.
[2023-04-07 14:00:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:31] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-04-07 14:00:31] [INFO ] Invariant cache hit.
[2023-04-07 14:00:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 s6), p0:(OR (GT s5 s7) (GT s8 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 47 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-10 finished in 242 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&&(p1 U p2)))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 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 2 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2023-04-07 14:00:31] [INFO ] Invariant cache hit.
[2023-04-07 14:00:31] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 14:00:31] [INFO ] Invariant cache hit.
[2023-04-07 14:00:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:31] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-04-07 14:00:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:00:31] [INFO ] Invariant cache hit.
[2023-04-07 14:00:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ s2 s10), p0:(LEQ s0 s5), p1:(LEQ s4 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 84 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-12 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 26 edges and 9 vertex of which 8 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 1 ms. Remains 8 /12 variables (removed 4) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 8 cols
[2023-04-07 14:00:31] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 14:00:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 14:00:31] [INFO ] Invariant cache hit.
[2023-04-07 14:00:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:31] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-07 14:00:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:00:31] [INFO ] Invariant cache hit.
[2023-04-07 14:00:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 8/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 124 ms.
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-13 finished in 288 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 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 5 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-07 14:00:32] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 14:00:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 14:00:32] [INFO ] Invariant cache hit.
[2023-04-07 14:00:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:00:32] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-04-07 14:00:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 14:00:32] [INFO ] Invariant cache hit.
[2023-04-07 14:00:32] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 389 ms. Remains : 9/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D03N100-LTLCardinality-15 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 s7 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D03N100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D03N100-LTLCardinality-15 finished in 447 ms.
All properties solved by simple procedures.
Total runtime 14146 ms.
BK_STOP 1680876033561
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-D03N100"
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-D03N100, 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-167987243500163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D03N100.tgz
mv CryptoMiner-PT-D03N100 execution
cd execution
if [ "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 '
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 ;