Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208200262.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r109-tall-171624208200262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 17K Apr 12 12:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 12:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 36K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 226K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 12 12:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 200K Apr 12 12:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 15K May 18 16:42 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 1716323326007

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=gold2023
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
[2024-05-21 20:28:47] [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]
[2024-05-21 20:28:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:28:47] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2024-05-21 20:28:47] [INFO ] Transformed 33 places.
[2024-05-21 20:28:47] [INFO ] Transformed 33 transitions.
[2024-05-21 20:28:47] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-13 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
[2024-05-21 20:28:47] [INFO ] Computed 1 invariants in 4 ms
[2024-05-21 20:28:47] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 20:28:47] [INFO ] Invariant cache hit.
[2024-05-21 20:28:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:28:47] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 20:28:47] [INFO ] Invariant cache hit.
[2024-05-21 20:28:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 33/33 places, 33/33 transitions.
Support contains 33 out of 33 places after structural reductions.
[2024-05-21 20:28:48] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:28:48] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:28:48] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 10041 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=223 ) properties (out of 21) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-21 20:28:48] [INFO ] Invariant cache hit.
[2024-05-21 20:28:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:28:48] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-21 20:28:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 20:28:48] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2024-05-21 20:28:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:28:48] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :4 sat :3
[2024-05-21 20:28:48] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-21 20:28:48] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (trivial) has 18 edges and 33 vertex of which 11 / 33 are part of one of the 1 SCC in 4 ms
Free SCC test removed 10 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 42 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 11 ms. Remains 20 /33 variables (removed 13) and now considering 22/33 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 20/33 places, 22/33 transitions.
Incomplete random walk after 10008 steps, including 101 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 326 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 337 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-21 20:28:48] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 20 cols
[2024-05-21 20:28:48] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 20:28:48] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:28:48] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:28:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 20:28:48] [INFO ] After 3ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:28:48] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-21 20:28:48] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 22/22 transitions.
Incomplete random walk after 10048 steps, including 104 resets, run finished after 4 ms. (steps per millisecond=2512 ) properties (out of 1) seen :0
Finished Best-First random walk after 4540 steps, including 151 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1135 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2024-05-21 20:28:49] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 20:28:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 20:28:49] [INFO ] Invariant cache hit.
[2024-05-21 20:28:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:28:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-21 20:28:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:28:49] [INFO ] Invariant cache hit.
[2024-05-21 20:28:49] [INFO ] Dead Transitions using invariants and state equation in 32 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 109 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 127 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 232 ms.
Stack based approach found an accepted trace after 6425 steps with 0 reset with depth 6426 and stack size 6426 in 13 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-00 finished in 530 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 (trivial) has 11 edges and 33 vertex of which 11 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 4 ms. Remains 23 /33 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-21 20:28:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 20:28:49] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 20:28:49] [INFO ] Invariant cache hit.
[2024-05-21 20:28:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:28:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-21 20:28:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:28:49] [INFO ] Invariant cache hit.
[2024-05-21 20:28:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 23/33 places, 23/33 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-01 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 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-01 finished in 219 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 U X((p1&&X((!p2 U X((!p2&&X(!p2)))))))))'
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.
// Phase 1: matrix 33 rows 33 cols
[2024-05-21 20:28:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 20:28:49] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 20:28:49] [INFO ] Invariant cache hit.
[2024-05-21 20:28:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:28:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 20:28:50] [INFO ] Invariant cache hit.
[2024-05-21 20:28:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 753 ms :[p2, p2, p2, p2, p2, p2, p2, p2, (OR (NOT p1) p2), (OR (NOT p1) p2), p2, p2, p2, p2, p2, p2, p2, true, (OR (NOT p1) p2)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}, { cond=p2, acceptance={} source=0 dest: 17}], [{ cond=p2, acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 11}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 12}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 14}], [{ cond=p2, acceptance={} source=4 dest: 17}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={0} source=7 dest: 11}, { cond=(OR (AND p0 p1) (AND p0 (NOT p2))), acceptance={0} source=7 dest: 12}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=7 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=7 dest: 14}], [{ cond=p1, acceptance={} source=8 dest: 5}, { cond=(NOT p1), acceptance={} source=8 dest: 17}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}], [{ cond=p2, acceptance={} source=10 dest: 0}, { cond=(NOT p2), acceptance={} source=10 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 0}, { cond=(NOT p2), acceptance={} source=11 dest: 1}, { cond=(AND p1 p2), acceptance={} source=11 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=12 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=12 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=12 dest: 11}, { cond=(AND p0 p1 p2), acceptance={0} source=12 dest: 12}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=12 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=12 dest: 14}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=13 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=13 dest: 4}, { cond=(AND p1 p2), acceptance={} source=13 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 17}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=14 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=14 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=14 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=14 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=14 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=14 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=14 dest: 15}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=14 dest: 16}], [{ cond=(AND p1 p2), acceptance={} source=15 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=15 dest: 17}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=16 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=16 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=16 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=16 dest: 9}], [{ cond=true, acceptance={0} source=17 dest: 17}], [{ cond=(NOT p0), acceptance={} source=18 dest: 8}, { cond=p0, acceptance={} source=18 dest: 9}]], initial=18, aps=[p2:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 307 ms.
Product exploration explored 100000 steps with 20000 reset in 253 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 p2) p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 376 ms. Reduced automaton from 19 states, 56 edges and 3 AP (stutter sensitive) to 19 states, 55 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 739 ms :[p2, p2, p2, p2, p2, p2, p2, p2, (OR (NOT p1) p2), (OR (NOT p1) p2), p2, p2, p2, p2, p2, p2, p2, (OR (NOT p1) p2), true]
Incomplete random walk after 10082 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=325 ) properties (out of 23) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) 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 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 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 20:28:52] [INFO ] Invariant cache hit.
[2024-05-21 20:28:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:28:52] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 20:28:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:28:52] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p1 p2))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1) p2)), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 22 factoid took 1644 ms. Reduced automaton from 19 states, 55 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 484 ms :[p2, p2, p2, p2, p2, p2, p2, true, p2, p2]
Stuttering acceptance computed with spot in 338 ms :[p2, p2, p2, p2, p2, p2, p2, true, p2, p2]
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.
[2024-05-21 20:28:55] [INFO ] Invariant cache hit.
[2024-05-21 20:28:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 20:28:55] [INFO ] Invariant cache hit.
[2024-05-21 20:28:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:28:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 20:28:55] [INFO ] Invariant cache hit.
[2024-05-21 20:28:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 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.1 ms
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Incomplete random walk after 10035 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1115 ) properties (out of 5) seen :0
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), true]
False Knowledge obtained : [(F (NOT (AND p0 p1 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F p2), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 369 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Stuttering acceptance computed with spot in 348 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Product exploration explored 100000 steps with 20000 reset in 83 ms.
Product exploration explored 100000 steps with 20000 reset in 87 ms.
Applying partial POR strategy [true, false, false, false, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 372 ms :[p2, p2, p2, p2, p2, p2, p2, p2, p2, true]
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:28:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:28:57] [INFO ] Invariant cache hit.
[2024-05-21 20:28:57] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 33/33 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin11276293518560320655
[2024-05-21 20:28:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11276293518560320655
Running compilation step : cd /tmp/ltsmin11276293518560320655;'/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 183 ms.
Running link step : cd /tmp/ltsmin11276293518560320655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11276293518560320655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1505746348841869963.hoa' '--buchi-type=spotba'
LTSmin run took 458 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-03 finished in 8753 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((p0&&F((p1||X(p2)))))))'
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.
[2024-05-21 20:28:58] [INFO ] Invariant cache hit.
[2024-05-21 20:28:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 20:28:58] [INFO ] Invariant cache hit.
[2024-05-21 20:28:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:28:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 20:28:58] [INFO ] Invariant cache hit.
[2024-05-21 20:28:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Product exploration explored 100000 steps with 25000 reset in 85 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 p0 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2006 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2681188 steps, run timeout after 3001 ms. (steps per millisecond=893 ) properties seen :{}
Probabilistic random walk after 2681188 steps, saw 1142376 distinct states, run finished after 3002 ms. (steps per millisecond=893 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:29:02] [INFO ] Invariant cache hit.
[2024-05-21 20:29:02] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (AND p0 (NOT p1)))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-05 finished in 3760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 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.
[2024-05-21 20:29:02] [INFO ] Invariant cache hit.
[2024-05-21 20:29:02] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 20:29:02] [INFO ] Invariant cache hit.
[2024-05-21 20:29:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:02] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 20:29:02] [INFO ] Invariant cache hit.
[2024-05-21 20:29:02] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 33/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-07 finished in 169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 6 out of 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 5 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2024-05-21 20:29:02] [INFO ] Computed 0 invariants in 19 ms
[2024-05-21 20:29:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 20:29:02] [INFO ] Invariant cache hit.
[2024-05-21 20:29:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:02] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-21 20:29:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:29:02] [INFO ] Invariant cache hit.
[2024-05-21 20:29:02] [INFO ] Dead Transitions using invariants and state equation in 27 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 137 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ s17 s26), p0:(GT s4 s16), p1:(LEQ s22 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 114 ms.
Stack based approach found an accepted trace after 14427 steps with 0 reset with depth 14428 and stack size 14426 in 25 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-08 finished in 371 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(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 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] Dead Transitions using invariants and state equation in 31 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 92 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s2 s11), p0:(LEQ 3 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-10 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0)&&F(G(p1)))))'
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 4 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 20:29:03] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] Dead Transitions using invariants and state equation in 27 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 90 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s8 s24), p1:(OR (GT s24 s15) (GT s12 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 2379 steps with 0 reset with depth 2380 and stack size 2380 in 4 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-11 finished in 371 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 1 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 3 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-21 20:29:03] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [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 91 ms. Remains : 32/33 places, 33/33 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s7)], 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 89 ms.
Stack based approach found an accepted trace after 19933 steps with 0 reset with depth 19934 and stack size 19934 in 22 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-14 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 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.
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-21 20:29:03] [INFO ] Invariant cache hit.
[2024-05-21 20:29:03] [INFO ] Dead Transitions using invariants and state equation in 26 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 :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLCardinality-15 finished in 180 ms.
All properties solved by simple procedures.
Total runtime 16641 ms.

BK_STOP 1716323345059

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r109-tall-171624208200262"
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 ;