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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.2K Apr 12 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 12:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 12:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K 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-COL-D03N010-LTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D03N010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716309024944

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-COL-D03N010
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-21 16:30:26] [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 16:30:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:30:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 16:30:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 16:30:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 621 ms
[2024-05-21 16:30:27] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 12 PT places and 20.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 16:30:27] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2024-05-21 16:30:27] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
Incomplete random walk after 10000 steps, including 1338 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10001 steps, including 243 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 270 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 243 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 16:30:27] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2024-05-21 16:30:27] [INFO ] Computed 0 invariants in 6 ms
[2024-05-21 16:30:27] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:30:27] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-21 16:30:27] [INFO ] Flatten gal took : 12 ms
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:30:27] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2024-05-21 16:30:27] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 34 arcs in 5 ms.
[2024-05-21 16:30:27] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-21 16:30:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 16:30:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 16:30:27] [INFO ] Invariant cache hit.
[2024-05-21 16:30:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-21 16:30:27] [INFO ] Invariant cache hit.
[2024-05-21 16:30:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2024-05-21 16:30:27] [INFO ] Flatten gal took : 2 ms
[2024-05-21 16:30:27] [INFO ] Flatten gal took : 3 ms
[2024-05-21 16:30:27] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 16:30:27] [INFO ] Invariant cache hit.
[2024-05-21 16:30:27] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 16:30:27] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:30:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 16:30:28] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(F(!p0)||X(G(p1)))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:28] [INFO ] Invariant cache hit.
[2024-05-21 16:30:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 16:30:28] [INFO ] Invariant cache hit.
[2024-05-21 16:30:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 16:30:28] [INFO ] Invariant cache hit.
[2024-05-21 16:30:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 12/12 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 441 ms :[true, p0, (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(LEQ (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11)), p1:(GT (ADD s8 s9 s10 s11) (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-01 finished in 575 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 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:28] [INFO ] Invariant cache hit.
[2024-05-21 16:30:28] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 16:30:28] [INFO ] Invariant cache hit.
[2024-05-21 16:30:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:28] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-21 16:30:28] [INFO ] Invariant cache hit.
[2024-05-21 16:30:28] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-02 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 (GT (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11)) (GT 2 (ADD s8 s9 s10 s11)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 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 20 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-COL-D03N010-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-02 finished in 449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:29] [INFO ] Invariant cache hit.
[2024-05-21 16:30:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 16:30:29] [INFO ] Invariant cache hit.
[2024-05-21 16:30:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-21 16:30:29] [INFO ] Invariant cache hit.
[2024-05-21 16:30:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s4 s5 s6 s7) (ADD s8 s9 s10 s11)), p1:(LEQ 1 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:30] [INFO ] Invariant cache hit.
[2024-05-21 16:30:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 16:30:30] [INFO ] Invariant cache hit.
[2024-05-21 16:30:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:30] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-21 16:30:30] [INFO ] Invariant cache hit.
[2024-05-21 16:30:30] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Finished Best-First random walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 173 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:30:31] [INFO ] Invariant cache hit.
[2024-05-21 16:30:31] [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 35 ms. Remains : 12/12 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin6548535556373848137
[2024-05-21 16:30:31] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6548535556373848137
Running compilation step : cd /tmp/ltsmin6548535556373848137;'/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 162 ms.
Running link step : cd /tmp/ltsmin6548535556373848137;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6548535556373848137;'/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/stateBased11869087139310420162.hoa' '--buchi-type=spotba'
LTSmin run took 339 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-04 finished in 3223 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&&F(G(!p1)))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:32] [INFO ] Invariant cache hit.
[2024-05-21 16:30:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 16:30:32] [INFO ] Invariant cache hit.
[2024-05-21 16:30:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:32] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-21 16:30:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:30:32] [INFO ] Invariant cache hit.
[2024-05-21 16:30:32] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s8 s9 s10 s11)), p1:(LEQ 1 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 80 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-05 finished in 274 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((F(p1)&&X(p2)&&p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:32] [INFO ] Invariant cache hit.
[2024-05-21 16:30:32] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 16:30:32] [INFO ] Invariant cache hit.
[2024-05-21 16:30:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:32] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-21 16:30:32] [INFO ] Invariant cache hit.
[2024-05-21 16:30:32] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ (ADD s4 s5 s6 s7) (ADD s8 s9 s10 s11)) (LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7))), p1:(LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7)), p2:(LEQ ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11774 reset in 160 ms.
Stack based approach found an accepted trace after 40 steps with 5 reset with depth 7 and stack size 7 in 1 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-06 finished in 358 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)||G(p1))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:33] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7)) (GT (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11))), p1:(GT 1 (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 66 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-07 finished in 274 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)||(p1 U p2))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-21 16:30:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s4 s5 s6 s7)), p2:(AND (LEQ (ADD s0 s1 s2 s3) (ADD s8 s9 s10 s11)) (LEQ (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3))), p1:(LEQ 1 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-09 finished in 429 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)||G(F(p1)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:33] [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.
[2024-05-21 16:30:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3)), p1:(LEQ (ADD s4 s5 s6 s7) (ADD s8 s9 s10 s11))], 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 56 ms.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 16:30:34] [INFO ] Invariant cache hit.
[2024-05-21 16:30:34] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:30:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-21 16:30:34] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-11 finished in 637 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||G(p0)))||F(G(!p1))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 4 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 6 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-21 16:30:34] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 16:30:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 16:30:34] [INFO ] Invariant cache hit.
[2024-05-21 16:30:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-21 16:30:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:30:34] [INFO ] Invariant cache hit.
[2024-05-21 16:30:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 9/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 98 ms :[false, (AND (NOT p0) p1), p1]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4) (ADD s5 s6 s7 s8)), p1:(GT 1 (ADD s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 26 edges and 9 vertex of which 1 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/9 stabilizing places and 8/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 229 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 109 ms :[false, (AND (NOT p0) p1), p1]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 284 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 90 ms :[false, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 111 ms :[false, (AND (NOT p0) p1), p1]
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-21 16:30:35] [INFO ] Invariant cache hit.
[2024-05-21 16:30:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 16:30:35] [INFO ] Invariant cache hit.
[2024-05-21 16:30:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:35] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-21 16:30:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:30:35] [INFO ] Invariant cache hit.
[2024-05-21 16:30:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 9/9 places, 9/9 transitions.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 26 edges and 9 vertex of which 1 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/9 stabilizing places and 8/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 230 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 94 ms :[false, (AND (NOT p0) p1), p1]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 292 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 95 ms :[false, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 99 ms :[false, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 103 ms :[false, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 56 ms.
Built C files in :
/tmp/ltsmin16596931480717818864
[2024-05-21 16:30:36] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-21 16:30:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:30:36] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-21 16:30:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:30:36] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-21 16:30:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:30:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16596931480717818864
Running compilation step : cd /tmp/ltsmin16596931480717818864;'/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 74 ms.
Running link step : cd /tmp/ltsmin16596931480717818864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin16596931480717818864;'/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/stateBased10626951025839842927.hoa' '--buchi-type=spotba'
LTSmin run took 88 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-12 finished in 2576 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)))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 4 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
[2024-05-21 16:30:37] [INFO ] Invariant cache hit.
[2024-05-21 16:30:37] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 16:30:37] [INFO ] Invariant cache hit.
[2024-05-21 16:30:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-21 16:30:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:30:37] [INFO ] Invariant cache hit.
[2024-05-21 16:30:37] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/12 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 9/12 places, 9/12 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 (ADD s5 s6 s7 s8)), p0:(AND (LEQ (ADD s1 s2 s3 s4) (ADD s5 s6 s7 s8)) (LEQ 2 (ADD s5 s6 s7 s8)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-13 finished in 202 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((!p1&&X(G(!p2))))||p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-21 16:30:37] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 16:30:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 16:30:37] [INFO ] Invariant cache hit.
[2024-05-21 16:30:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:30:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-21 16:30:37] [INFO ] Invariant cache hit.
[2024-05-21 16:30:37] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR p2 p1)]
Running random walk in product with property : CryptoMiner-COL-D03N010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR p1 p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GT (ADD s4 s5 s6 s7) (ADD s0 s1 s2 s3)) (LEQ (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7))), p1:(LEQ 1 (ADD s0 s1 s2 s3)), p2:(LEQ 2 (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N010-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N010-LTLCardinality-15 finished in 200 ms.
All properties solved by simple procedures.
Total runtime 11142 ms.

BK_STOP 1716309038422

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

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