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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 32K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 214K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K 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-D10N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D10N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680885327712

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-D10N100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 16:35:29] [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 16:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 16:35:29] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-04-07 16:35:29] [INFO ] Transformed 33 places.
[2023-04-07 16:35:29] [INFO ] Transformed 33 transitions.
[2023-04-07 16:35:29] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 16:35:29] [INFO ] Computed 1 invariants in 7 ms
[2023-04-07 16:35:29] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-04-07 16:35:29] [INFO ] Invariant cache hit.
[2023-04-07 16:35:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-04-07 16:35:29] [INFO ] Invariant cache hit.
[2023-04-07 16:35:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 33/33 places, 33/33 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-04-07 16:35:29] [INFO ] Flatten gal took : 16 ms
[2023-04-07 16:35:29] [INFO ] Flatten gal took : 5 ms
[2023-04-07 16:35:29] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 10046 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-07 16:35:30] [INFO ] Invariant cache hit.
[2023-04-07 16:35:30] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 16:35:30] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 16:35:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-04-07 16:35:30] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-04-07 16:35:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:30] [INFO ] After 18ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-04-07 16:35:30] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 16:35:30] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 37 ms.
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 53 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 32
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 9 place count 32 transition count 25
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 25 transition count 25
Applied a total of 16 rules in 14 ms. Remains 25 /33 variables (removed 8) and now considering 25/33 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 25/33 places, 25/33 transitions.
Incomplete random walk after 10031 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=771 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 521406 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 521406 steps, saw 208826 distinct states, run finished after 3002 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 25 rows 25 cols
[2023-04-07 16:35:33] [INFO ] Computed 1 invariants in 3 ms
[2023-04-07 16:35:33] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 16:35:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 16:35:33] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 16:35:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:33] [INFO ] After 14ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 16:35:33] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 16:35:33] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 25/25 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-04-07 16:35:33] [INFO ] Invariant cache hit.
[2023-04-07 16:35:33] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 16:35:33] [INFO ] Invariant cache hit.
[2023-04-07 16:35:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-04-07 16:35:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 16:35:33] [INFO ] Invariant cache hit.
[2023-04-07 16:35:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 25/25 places, 25/25 transitions.
Graph (complete) has 33 edges and 25 vertex of which 21 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 21 transition count 21
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 19 transition count 20
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 8 place count 19 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 11 place count 16 transition count 17
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 14 place count 16 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 17 place count 13 transition count 14
Applied a total of 17 rules in 5 ms. Remains 13 /25 variables (removed 12) and now considering 14/25 (removed 11) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 14 rows 13 cols
[2023-04-07 16:35:33] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:35:34] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 16:35:34] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 16:35:34] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 16:35:34] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 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' '!(G(F(p0)))'
Support contains 11 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 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 5 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 16:35:34] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:35:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-04-07 16:35:34] [INFO ] Invariant cache hit.
[2023-04-07 16:35:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:34] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 16:35:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 16:35:34] [INFO ] Invariant cache hit.
[2023-04-07 16:35:34] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 32/33 places, 33/33 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 188 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-01 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 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], 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 215 ms.
Stack based approach found an accepted trace after 6936 steps with 0 reset with depth 6937 and stack size 6937 in 19 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-01 finished in 595 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 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 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 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:35:34] [INFO ] Invariant cache hit.
[2023-04-07 16:35:35] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-04-07 16:35:35] [INFO ] Invariant cache hit.
[2023-04-07 16:35:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:35] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-04-07 16:35:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:35:35] [INFO ] Invariant cache hit.
[2023-04-07 16:35:35] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-02 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 s4 s5 s6 s7 s8 s9 s10) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31))], 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 232 ms.
Product exploration explored 100000 steps with 0 reset in 198 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 35 ms :[(NOT p0)]
Incomplete random walk after 10038 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3346 ) properties (out of 1) seen :0
Finished Best-First random walk after 396 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=198 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 22 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:35:35] [INFO ] Invariant cache hit.
[2023-04-07 16:35:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 16:35:35] [INFO ] Invariant cache hit.
[2023-04-07 16:35:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:36] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 16:35:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:35:36] [INFO ] Invariant cache hit.
[2023-04-07 16:35:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 41 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 97 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Built C files in :
/tmp/ltsmin10775892423480359213
[2023-04-07 16:35:36] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:35:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:36] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:35:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:36] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:35:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10775892423480359213
Running compilation step : cd /tmp/ltsmin10775892423480359213;'/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 197 ms.
Running link step : cd /tmp/ltsmin10775892423480359213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10775892423480359213;'/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/stateBased5774898410739919386.hoa' '--buchi-type=spotba'
LTSmin run took 161 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-02 finished in 2415 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((X((G(p0) U p1))&&F(!p0))))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 16:35:37] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 16:35:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 16:35:37] [INFO ] Invariant cache hit.
[2023-04-07 16:35:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-04-07 16:35:37] [INFO ] Invariant cache hit.
[2023-04-07 16:35:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-03 finished in 471 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 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 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 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 16:35:37] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:35:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 16:35:37] [INFO ] Invariant cache hit.
[2023-04-07 16:35:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 16:35:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:35:37] [INFO ] Invariant cache hit.
[2023-04-07 16:35:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)) (LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30...], 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 149 ms.
Stack based approach found an accepted trace after 7160 steps with 0 reset with depth 7161 and stack size 7161 in 13 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-04 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||X(F((p1||G(p2)||G(!p0)))))))'
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2023-04-07 16:35:38] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 16:35:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 16:35:38] [INFO ] Invariant cache hit.
[2023-04-07 16:35:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:38] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 16:35:38] [INFO ] Invariant cache hit.
[2023-04-07 16:35:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p2:(GT (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 234 ms.
Stack based approach found an accepted trace after 626 steps with 0 reset with depth 627 and stack size 627 in 2 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-05 finished in 432 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) U G(!p1)) U (F(G(p2))||(F(!p1)&&X(!p0)))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:35:38] [INFO ] Invariant cache hit.
[2023-04-07 16:35:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 16:35:38] [INFO ] Invariant cache hit.
[2023-04-07 16:35:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:38] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-07 16:35:38] [INFO ] Invariant cache hit.
[2023-04-07 16:35:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)), p2:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 114 ms.
Product exploration explored 100000 steps with 3 reset in 177 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p2 (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 580 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
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 : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p2 (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 664 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 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Support contains 11 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:35:40] [INFO ] Invariant cache hit.
[2023-04-07 16:35:40] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 16:35:40] [INFO ] Invariant cache hit.
[2023-04-07 16:35:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:40] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 16:35:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 16:35:40] [INFO ] Invariant cache hit.
[2023-04-07 16:35:40] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 33/33 places, 33/33 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 35 ms :[(NOT p2)]
Finished random walk after 3446 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1723 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 101 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 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 0 reset in 136 ms.
Built C files in :
/tmp/ltsmin14444684011502083237
[2023-04-07 16:35:41] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:35:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:41] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:35:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:41] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:35:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14444684011502083237
Running compilation step : cd /tmp/ltsmin14444684011502083237;'/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 97 ms.
Running link step : cd /tmp/ltsmin14444684011502083237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14444684011502083237;'/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/stateBased320501446156299003.hoa' '--buchi-type=spotba'
LTSmin run took 128 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-06 finished in 3079 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)) U (p1||G(!p1)))))'
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:35:41] [INFO ] Invariant cache hit.
[2023-04-07 16:35:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 16:35:41] [INFO ] Invariant cache hit.
[2023-04-07 16:35:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:41] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 16:35:41] [INFO ] Invariant cache hit.
[2023-04-07 16:35:41] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 143 ms :[p0, false, false, (AND p0 p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32)), p1:(GT 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s...], 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 60 ms.
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-07 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||(!p1 U p2)))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:35:42] [INFO ] Invariant cache hit.
[2023-04-07 16:35:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 16:35:42] [INFO ] Invariant cache hit.
[2023-04-07 16:35:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:42] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-04-07 16:35:42] [INFO ] Invariant cache hit.
[2023-04-07 16:35:42] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ s12 s2), p2:(LEQ s11 s0), p0:(LEQ s10 s32)], 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-08 finished in 522 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(F(p0))||(F(p0)&&F(G(p1))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 3 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 16:35:42] [INFO ] Computed 0 invariants in 3 ms
[2023-04-07 16:35:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 16:35:42] [INFO ] Invariant cache hit.
[2023-04-07 16:35:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:42] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 16:35:42] [INFO ] Invariant cache hit.
[2023-04-07 16:35:42] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s1 s14), p1:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 200 reset in 81 ms.
Product exploration explored 100000 steps with 188 reset in 106 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.6 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 202 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 300 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 16:35:44] [INFO ] Invariant cache hit.
[2023-04-07 16:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:35:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 16:35:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:35:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-07 16:35:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:35:44] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 16:35:44] [INFO ] Added : 21 causal constraints over 5 iterations in 43 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:35:44] [INFO ] Invariant cache hit.
[2023-04-07 16:35:44] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 16:35:44] [INFO ] Invariant cache hit.
[2023-04-07 16:35:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:44] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 16:35:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:35:44] [INFO ] Invariant cache hit.
[2023-04-07 16:35:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 202 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 295 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-04-07 16:35:45] [INFO ] Invariant cache hit.
[2023-04-07 16:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:35:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-04-07 16:35:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:35:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:35:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-07 16:35:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-04-07 16:35:45] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 16:35:45] [INFO ] Added : 21 causal constraints over 5 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 331 reset in 91 ms.
Product exploration explored 100000 steps with 230 reset in 96 ms.
Built C files in :
/tmp/ltsmin8125716663651757036
[2023-04-07 16:35:45] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:35:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:45] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:35:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:45] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:35:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8125716663651757036
Running compilation step : cd /tmp/ltsmin8125716663651757036;'/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 96 ms.
Running link step : cd /tmp/ltsmin8125716663651757036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8125716663651757036;'/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/stateBased8117958188863412001.hoa' '--buchi-type=spotba'
LTSmin run took 257 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-10 finished in 3535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 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 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:35:46] [INFO ] Invariant cache hit.
[2023-04-07 16:35:46] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 16:35:46] [INFO ] Invariant cache hit.
[2023-04-07 16:35:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 16:35:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 16:35:46] [INFO ] Invariant cache hit.
[2023-04-07 16:35:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(GT 3 s17), p0:(OR (LEQ s5 s24) (LEQ s15 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 113 ms.
Product exploration explored 100000 steps with 0 reset in 133 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 238 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=836 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 625327 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625327 steps, saw 283986 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 16:35:50] [INFO ] Invariant cache hit.
[2023-04-07 16:35:50] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 16:35:50] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 16:35:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:50] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 16:35:50] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 16:35:50] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (complete) has 50 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 24 transition count 21
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 20 transition count 21
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 20 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 16 transition count 17
Applied a total of 21 rules in 3 ms. Remains 16 /32 variables (removed 16) and now considering 17/33 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 16/32 places, 17/33 transitions.
Incomplete random walk after 10033 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1672 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 16 cols
[2023-04-07 16:35:50] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 16:35:50] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 16:35:50] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 16:35:50] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:50] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 16:35:50] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 16/16 places, 17/17 transitions.
Incomplete random walk after 10044 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=2511 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1491309 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :{}
Probabilistic random walk after 1491309 steps, saw 314030 distinct states, run finished after 3002 ms. (steps per millisecond=496 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 16:35:53] [INFO ] Invariant cache hit.
[2023-04-07 16:35:53] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 16:35:53] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 16:35:53] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:53] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 16:35:53] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 16/16 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-04-07 16:35:53] [INFO ] Invariant cache hit.
[2023-04-07 16:35:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 16:35:53] [INFO ] Invariant cache hit.
[2023-04-07 16:35:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 16:35:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-07 16:35:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:35:53] [INFO ] Invariant cache hit.
[2023-04-07 16:35:53] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 16/16 places, 17/17 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 14 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 14 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 13 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 9 place count 13 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 12 place count 10 transition count 11
Applied a total of 12 rules in 4 ms. Remains 10 /16 variables (removed 6) and now considering 11/17 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-04-07 16:35:53] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 16:35:53] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 16:35:53] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:53] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 16:35:53] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 212 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 16:35:54] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 16:35:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 16:35:54] [INFO ] Invariant cache hit.
[2023-04-07 16:35:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:54] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-04-07 16:35:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:35:54] [INFO ] Invariant cache hit.
[2023-04-07 16:35:54] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 171 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=716 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-04-07 16:35:54] [INFO ] Invariant cache hit.
[2023-04-07 16:35:54] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 16:35:54] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:35:54] [INFO ] After 8ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:54] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 16:35:54] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (complete) has 50 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 24 transition count 21
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 20 transition count 21
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 20 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 16 transition count 17
Applied a total of 21 rules in 4 ms. Remains 16 /32 variables (removed 16) and now considering 17/33 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 16/32 places, 17/33 transitions.
Incomplete random walk after 10022 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1670 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1869414 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :{}
Probabilistic random walk after 1869414 steps, saw 390042 distinct states, run finished after 3001 ms. (steps per millisecond=622 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 16 cols
[2023-04-07 16:35:57] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:35:57] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 16:35:57] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 16:35:57] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:57] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 16:35:57] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-04-07 16:35:57] [INFO ] Invariant cache hit.
[2023-04-07 16:35:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 16:35:57] [INFO ] Invariant cache hit.
[2023-04-07 16:35:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 16:35:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 16:35:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:35:57] [INFO ] Invariant cache hit.
[2023-04-07 16:35:57] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 16/16 places, 17/17 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 14 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 14 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 13 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 9 place count 13 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 12 place count 10 transition count 11
Applied a total of 12 rules in 5 ms. Remains 10 /16 variables (removed 6) and now considering 11/17 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-04-07 16:35:57] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:35:57] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 16:35:57] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 16:35:57] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 16:35:57] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Built C files in :
/tmp/ltsmin8777891960373245684
[2023-04-07 16:35:58] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:35:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:58] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:35:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:58] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:35:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:35:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8777891960373245684
Running compilation step : cd /tmp/ltsmin8777891960373245684;'/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 112 ms.
Running link step : cd /tmp/ltsmin8777891960373245684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8777891960373245684;'/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/stateBased1533669149805503162.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 13 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 16:36:13] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:36:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 16:36:13] [INFO ] Invariant cache hit.
[2023-04-07 16:36:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:36:13] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-04-07 16:36:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:36:13] [INFO ] Invariant cache hit.
[2023-04-07 16:36:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 32/32 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin16409396496427102896
[2023-04-07 16:36:13] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:36:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:36:13] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:36:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:36:13] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:36:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:36:13] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16409396496427102896
Running compilation step : cd /tmp/ltsmin16409396496427102896;'/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 108 ms.
Running link step : cd /tmp/ltsmin16409396496427102896;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16409396496427102896;'/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/stateBased12205165943221120142.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 16:36:28] [INFO ] Flatten gal took : 3 ms
[2023-04-07 16:36:28] [INFO ] Flatten gal took : 3 ms
[2023-04-07 16:36:28] [INFO ] Time to serialize gal into /tmp/LTL7613666341787153595.gal : 1 ms
[2023-04-07 16:36:29] [INFO ] Time to serialize properties into /tmp/LTL6341018047737910442.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7613666341787153595.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6256925077439291336.hoa' '-atoms' '/tmp/LTL6341018047737910442.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6341018047737910442.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6256925077439291336.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, Intersection with reachable at ea...219
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2023-04-07 16:36:44] [INFO ] Flatten gal took : 3 ms
[2023-04-07 16:36:44] [INFO ] Flatten gal took : 2 ms
[2023-04-07 16:36:44] [INFO ] Time to serialize gal into /tmp/LTL7523352179878958439.gal : 1 ms
[2023-04-07 16:36:44] [INFO ] Time to serialize properties into /tmp/LTL5638371137109768284.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7523352179878958439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5638371137109768284.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((capacity_c4<=state_c2)||(resource_c4<=state_c6))")||(G("(resource_c6<3)")))))
Formula 0 simplified : F(!"((capacity_c4<=state_c2)||(resource_c4<=state_c6))" & F!"(resource_c6<3)")
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, Intersection with reachable at ea...219
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2023-04-07 16:36:59] [INFO ] Flatten gal took : 2 ms
[2023-04-07 16:36:59] [INFO ] Applying decomposition
[2023-04-07 16:36:59] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10216924128441648282.txt' '-o' '/tmp/graph10216924128441648282.bin' '-w' '/tmp/graph10216924128441648282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10216924128441648282.bin' '-l' '-1' '-v' '-w' '/tmp/graph10216924128441648282.weights' '-q' '0' '-e' '0.001'
[2023-04-07 16:36:59] [INFO ] Decomposing Gal with order
[2023-04-07 16:36:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 16:36:59] [INFO ] Removed a total of 5 redundant transitions.
[2023-04-07 16:36:59] [INFO ] Flatten gal took : 24 ms
[2023-04-07 16:36:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-07 16:36:59] [INFO ] Time to serialize gal into /tmp/LTL9245129607881381677.gal : 1 ms
[2023-04-07 16:36:59] [INFO ] Time to serialize properties into /tmp/LTL13392523160505078321.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9245129607881381677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13392523160505078321.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((gu1.capacity_c4<=gu1.state_c2)||(gu10.resource_c4<=gu10.state_c6))")||(G("(gi2.gi2.gu6.resource_c6<3)")))))
Formula 0 simplified : F(!"((gu1.capacity_c4<=gu1.state_c2)||(gu10.resource_c4<=gu10.state_c6))" & F!"(gi2.gi2.gu6.resource_c6<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10860427197880303182
[2023-04-07 16:37:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10860427197880303182
Running compilation step : cd /tmp/ltsmin10860427197880303182;'/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 106 ms.
Running link step : cd /tmp/ltsmin10860427197880303182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10860427197880303182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([]((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-12 finished in 103158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:37:29] [INFO ] Invariant cache hit.
[2023-04-07 16:37:29] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 16:37:29] [INFO ] Invariant cache hit.
[2023-04-07 16:37:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:37:29] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 16:37:29] [INFO ] Invariant cache hit.
[2023-04-07 16:37:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s6) (LEQ s9 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-13 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(G(p1))) U X(X(G(p2)))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:37:29] [INFO ] Invariant cache hit.
[2023-04-07 16:37:29] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 16:37:29] [INFO ] Invariant cache hit.
[2023-04-07 16:37:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:37:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-04-07 16:37:29] [INFO ] Invariant cache hit.
[2023-04-07 16:37:29] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p2:(GT s17 s21), p0:(OR (LEQ s17 s21) (LEQ 1 s2)), p1:(LEQ s24 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 221 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10046 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=2511 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 16:37:30] [INFO ] Invariant cache hit.
[2023-04-07 16:37:30] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 16:37:30] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 16:37:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:37:30] [INFO ] After 7ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 16:37:31] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 16:37:31] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 33/33 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 32 transition count 32
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 10 place count 32 transition count 23
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 23 transition count 23
Applied a total of 19 rules in 3 ms. Remains 23 /32 variables (removed 9) and now considering 23/33 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 23/32 places, 23/33 transitions.
Incomplete random walk after 10031 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2006 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Finished probabilistic random walk after 24327 steps, run visited all 4 properties in 103 ms. (steps per millisecond=236 )
Probabilistic random walk after 24327 steps, saw 7624 distinct states, run finished after 113 ms. (steps per millisecond=215 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND p0 p2)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 558 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 326 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
[2023-04-07 16:37:32] [INFO ] Invariant cache hit.
[2023-04-07 16:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:37:32] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-04-07 16:37:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:37:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-07 16:37:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:37:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 0 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND p0 p2)), (F (NOT p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 601 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-14 finished in 3536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:37:33] [INFO ] Invariant cache hit.
[2023-04-07 16:37:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 16:37:33] [INFO ] Invariant cache hit.
[2023-04-07 16:37:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:37:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 16:37:33] [INFO ] Invariant cache hit.
[2023-04-07 16:37:33] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s14 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Stack based approach found an accepted trace after 2884 steps with 0 reset with depth 2885 and stack size 2885 in 3 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-15 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
[2023-04-07 16:37:33] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2023-04-07 16:37:33] [INFO ] Applying decomposition
[2023-04-07 16:37:33] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15354125446083378502.txt' '-o' '/tmp/graph15354125446083378502.bin' '-w' '/tmp/graph15354125446083378502.weights'
Built C files in :
/tmp/ltsmin9042778015108489384
[2023-04-07 16:37:33] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:37:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:37:33] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:37:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:37:33] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:37:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:37:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9042778015108489384
Running compilation step : cd /tmp/ltsmin9042778015108489384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15354125446083378502.bin' '-l' '-1' '-v' '-w' '/tmp/graph15354125446083378502.weights' '-q' '0' '-e' '0.001'
[2023-04-07 16:37:33] [INFO ] Decomposing Gal with order
[2023-04-07 16:37:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 16:37:33] [INFO ] Removed a total of 5 redundant transitions.
[2023-04-07 16:37:33] [INFO ] Flatten gal took : 5 ms
[2023-04-07 16:37:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-07 16:37:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality11544556768867395840.gal : 1 ms
[2023-04-07 16:37:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality11222536939355267046.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11544556768867395840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11222536939355267046.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(("((gu3.capacity_c4<=gu3.state_c2)||(gu11.resource_c4<=gu11.state_c6))")||(G("(gi2.gi2.gu7.resource_c6<3)")))))
Formula 0 simplified : F(!"((gu3.capacity_c4<=gu3.state_c2)||(gu11.resource_c4<=gu11.state_c6))" & F!"(gi2.gi2.gu7.resource_c6<3)")
Compilation finished in 221 ms.
Running link step : cd /tmp/ltsmin9042778015108489384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9042778015108489384;'/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' '--ltl' '[](([]((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi2.gi1.gu9.t12, gi2.gi2.gu10.t15, gi2.gi2.gu10.t16, gi2.gi3.gu12.t19, gi2.gi3.gu13.t11, gi2....300
Computing Next relation with stutter on 1.07187e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Initializing POR dependencies: labels 35, guards 33
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: LTL layer: formula: [](([]((LTLAPp1==true))||(LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.006: "[](([]((LTLAPp1==true))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.020: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.027: There are 37 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.027: State length is 34, there are 39 groups
pins2lts-mc-linux64( 0/ 8), 0.027: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.027: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.027: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.027: Visible groups: 0 / 39, labels: 2 / 37
pins2lts-mc-linux64( 0/ 8), 0.027: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.027: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.048: [Blue] ~120 levels ~960 states ~2968 transitions
pins2lts-mc-linux64( 5/ 8), 0.080: [Blue] ~135 levels ~1920 states ~4080 transitions
pins2lts-mc-linux64( 5/ 8), 0.198: [Blue] ~167 levels ~3840 states ~7264 transitions
pins2lts-mc-linux64( 5/ 8), 0.263: [Blue] ~295 levels ~7680 states ~16888 transitions
pins2lts-mc-linux64( 5/ 8), 0.430: [Blue] ~436 levels ~15360 states ~37656 transitions
pins2lts-mc-linux64( 5/ 8), 0.843: [Blue] ~436 levels ~30720 states ~87544 transitions
pins2lts-mc-linux64( 5/ 8), 1.217: [Blue] ~674 levels ~61440 states ~178368 transitions
pins2lts-mc-linux64( 5/ 8), 1.736: [Blue] ~976 levels ~122880 states ~422880 transitions
pins2lts-mc-linux64( 2/ 8), 3.678: [Blue] ~2462 levels ~245760 states ~944448 transitions
pins2lts-mc-linux64( 5/ 8), 5.793: [Blue] ~1532 levels ~491520 states ~1715504 transitions
pins2lts-mc-linux64( 5/ 8), 7.610: [Blue] ~5365 levels ~983040 states ~4058224 transitions
pins2lts-mc-linux64( 5/ 8), 9.661: [Blue] ~5365 levels ~1966080 states ~8154144 transitions
pins2lts-mc-linux64( 5/ 8), 15.304: [Blue] ~38748 levels ~3932160 states ~18606688 transitions
pins2lts-mc-linux64( 5/ 8), 27.129: [Blue] ~38748 levels ~7864320 states ~40240352 transitions
pins2lts-mc-linux64( 5/ 8), 46.508: [Blue] ~38748 levels ~15728640 states ~77396744 transitions
pins2lts-mc-linux64( 5/ 8), 90.455: [Blue] ~64196 levels ~31457280 states ~157601088 transitions
pins2lts-mc-linux64( 1/ 8), 108.191: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 108.211:
pins2lts-mc-linux64( 0/ 8), 108.211: Explored 28578395 states 172780600 transitions, fanout: 6.046
pins2lts-mc-linux64( 0/ 8), 108.211: Total exploration time 108.170 sec (108.110 sec minimum, 108.146 sec on average)
pins2lts-mc-linux64( 0/ 8), 108.211: States per second: 264199, Transitions per second: 1597306
pins2lts-mc-linux64( 0/ 8), 108.211:
pins2lts-mc-linux64( 0/ 8), 108.211: State space has 37484337 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 108.211: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 108.211: blue states: 28578395 (76.24%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 108.211: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 108.211: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 108.211:
pins2lts-mc-linux64( 0/ 8), 108.211: Total memory used for local state coloring: 248.1MB
pins2lts-mc-linux64( 0/ 8), 108.211:
pins2lts-mc-linux64( 0/ 8), 108.211: Queue width: 8B, total height: 16257030, memory: 124.03MB
pins2lts-mc-linux64( 0/ 8), 108.211: Tree memory: 542.0MB, 15.2 B/state, compr.: 11.0%
pins2lts-mc-linux64( 0/ 8), 108.211: Tree fill ratio (roots/leafs): 27.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 108.211: Stored 33 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 108.211: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 108.211: Est. total memory use: 666.0MB (~1148.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9042778015108489384;'/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' '--ltl' '[](([]((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9042778015108489384;'/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' '--ltl' '[](([]((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
79692 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,796.947,3006664,1,0,868,1.77696e+07,28,1125,2118,1.84121e+07,282
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 989896 ms.

BK_STOP 1680886320002

--------------------
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-D10N100"
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-D10N100, 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-167987243500203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D10N100.tgz
mv CryptoMiner-PT-D10N100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;