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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.9K Apr 12 12:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 12 12:33 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-D20N100-LTLCardinality-00
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-01
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-02
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-03
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-04
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-05
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-06
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-07
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-08
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-09
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-10
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-11
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-12
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-13
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-14
FORMULA_NAME CryptoMiner-COL-D20N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716314996956

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-D20N100
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-21 18:09:58] [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 18:09:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:09:58] [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 18:09:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 18:09:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 644 ms
[2024-05-21 18:09:59] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 63 PT places and 105.0 transition bindings in 16 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 18:09:59] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 5 ms.
[2024-05-21 18:09:59] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
Incomplete random walk after 10020 steps, including 212 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 18) seen :15
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 18:09:59] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2024-05-21 18:09:59] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 18:09:59] [INFO ] After 113ms 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 14 simplifications.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 18:09:59] [INFO ] Flatten gal took : 23 ms
[2024-05-21 18:09:59] [INFO ] Flatten gal took : 2 ms
Arc [0:1*[(MOD (ADD $x 1) 21)]] contains successor/predecessor on variables of sort CD
[2024-05-21 18:09:59] [INFO ] Unfolded HLPN to a Petri net with 63 places and 63 transitions 187 arcs in 7 ms.
[2024-05-21 18:09:59] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 18:09:59] [INFO ] Computed 1 invariants in 2 ms
[2024-05-21 18:09:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 18:09:59] [INFO ] Invariant cache hit.
[2024-05-21 18:09:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:09:59] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 18:09:59] [INFO ] Invariant cache hit.
[2024-05-21 18:09:59] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2024-05-21 18:09:59] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:10:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:10:00] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10063 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=304 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-21 18:10:00] [INFO ] Invariant cache hit.
[2024-05-21 18:10:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 18:10:00] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-21 18:10:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-21 18:10:00] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-21 18:10:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:10:00] [INFO ] After 84ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2024-05-21 18:10:00] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-21 18:10:00] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 153 ms.
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 103 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 62/63 places, 63/63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1118 ) properties (out of 5) seen :0
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=133 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 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((G(p2)&&p1)))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 18:10:01] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 18:10:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 18:10:01] [INFO ] Invariant cache hit.
[2024-05-21 18:10:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:10:01] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-21 18:10:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 18:10:01] [INFO ] Invariant cache hit.
[2024-05-21 18:10:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 62/63 places, 63/63 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s...], 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 421 ms.
Product exploration explored 100000 steps with 0 reset in 476 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X p0), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 128 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 6832 steps, including 2 resets, run visited all 4 properties in 7 ms. (steps per millisecond=976 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X p0), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 217 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
[2024-05-21 18:10:03] [INFO ] Invariant cache hit.
[2024-05-21 18:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 18:10:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 18:10:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:10:03] [INFO ] [Real]Added 20 Read/Feed constraints in 7 ms returned sat
[2024-05-21 18:10:03] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 18:10:03] [INFO ] Added : 19 causal constraints over 4 iterations in 47 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 18:10:03] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p1 p2))), (X p0), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 8 factoid took 241 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-01 finished in 2801 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(p1)||G(!p1))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 18:10:04] [INFO ] Computed 1 invariants in 4 ms
[2024-05-21 18:10:04] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:10:04] [INFO ] Invariant cache hit.
[2024-05-21 18:10:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:10:04] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-21 18:10:04] [INFO ] Invariant cache hit.
[2024-05-21 18:10:04] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, false, false, (NOT p1), p1]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-03 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: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33...], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-03 finished in 644 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 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:10:04] [INFO ] Invariant cache hit.
[2024-05-21 18:10:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 18:10:04] [INFO ] Invariant cache hit.
[2024-05-21 18:10:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:10:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-21 18:10:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:10:04] [INFO ] Invariant cache hit.
[2024-05-21 18:10:04] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s5...], 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 207 ms.
Product exploration explored 100000 steps with 0 reset in 281 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p0]
Finished random walk after 6809 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2269 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
Stuttering acceptance computed with spot in 43 ms :[p0]
[2024-05-21 18:10:05] [INFO ] Invariant cache hit.
Proved EG p0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-04 finished in 1299 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(X(X(F(p0))))))'
Support contains 21 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 9 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 18:10:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 18:10:06] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 18:10:06] [INFO ] Invariant cache hit.
[2024-05-21 18:10:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:10:06] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-21 18:10:06] [INFO ] Invariant cache hit.
[2024-05-21 18:10:06] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 220 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 18:10:07] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-05 finished in 1754 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||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&(!p0 U p1))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 18:10:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 18:10:07] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 18:10:07] [INFO ] Invariant cache hit.
[2024-05-21 18:10:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:10:07] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-21 18:10:07] [INFO ] Invariant cache hit.
[2024-05-21 18:10:08] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}]], initial=2, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s5...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 464 ms.
Product exploration explored 100000 steps with 0 reset in 491 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 4) seen :3
Finished Best-First random walk after 200 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 249 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:10:10] [INFO ] Invariant cache hit.
[2024-05-21 18:10:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 18:10:10] [INFO ] Invariant cache hit.
[2024-05-21 18:10:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:10:10] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-21 18:10:10] [INFO ] Invariant cache hit.
[2024-05-21 18:10:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1677 ) properties (out of 4) seen :3
Finished Best-First random walk after 200 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 306 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 388 ms.
Product exploration explored 100000 steps with 0 reset in 456 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 9 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:10:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 18:10:12] [INFO ] Invariant cache hit.
[2024-05-21 18:10:12] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 63/63 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin17319243487357828528
[2024-05-21 18:10:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17319243487357828528
Running compilation step : cd /tmp/ltsmin17319243487357828528;'/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 248 ms.
Running link step : cd /tmp/ltsmin17319243487357828528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17319243487357828528;'/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/stateBased54219240238099432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:10:27] [INFO ] Invariant cache hit.
[2024-05-21 18:10:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 18:10:27] [INFO ] Invariant cache hit.
[2024-05-21 18:10:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:10:27] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-21 18:10:27] [INFO ] Invariant cache hit.
[2024-05-21 18:10:27] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 63/63 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin3158836741605884046
[2024-05-21 18:10:27] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3158836741605884046
Running compilation step : cd /tmp/ltsmin3158836741605884046;'/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 140 ms.
Running link step : cd /tmp/ltsmin3158836741605884046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3158836741605884046;'/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/stateBased14037235673269722108.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 18:10:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:10:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:10:43] [INFO ] Time to serialize gal into /tmp/LTL16762496998938978264.gal : 1 ms
[2024-05-21 18:10:43] [INFO ] Time to serialize properties into /tmp/LTL6047300203919219832.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16762496998938978264.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3025658033708784424.hoa' '-atoms' '/tmp/LTL6047300203919219832.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((("((((((capacity_0+capacity_1)+(capacity_2+capacity_3))+((capacity_4+capacity_5)+(capacity_6+capacity_7)))+(((capacity_8+capacit...4556
Formula 0 simplified : X((!"((((((capacity_0+capacity_1)+(capacity_2+capacity_3))+((capacity_4+capacity_5)+(capacity_6+capacity_7)))+(((capacity_8+capacity...2251
Detected timeout of ITS tools.
[2024-05-21 18:11:13] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:11:13] [INFO ] Applying decomposition
[2024-05-21 18:11:13] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12224208014517664156.txt' '-o' '/tmp/graph12224208014517664156.bin' '-w' '/tmp/graph12224208014517664156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12224208014517664156.bin' '-l' '-1' '-v' '-w' '/tmp/graph12224208014517664156.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:11:13] [INFO ] Decomposing Gal with order
[2024-05-21 18:11:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:11:13] [INFO ] Flatten gal took : 16 ms
[2024-05-21 18:11:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 18:11:13] [INFO ] Time to serialize gal into /tmp/LTL13558309759505149427.gal : 1 ms
[2024-05-21 18:11:13] [INFO ] Time to serialize properties into /tmp/LTL17157551991707599867.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13558309759505149427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17157551991707599867.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((("((((((gu0.capacity_0+gu0.capacity_1)+(gu0.capacity_2+gu0.capacity_3))+((gu0.capacity_4+gu0.capacity_5)+(gu0.capacity_6+gu0.cap...5900
Formula 0 simplified : X((!"((((((gu0.capacity_0+gu0.capacity_1)+(gu0.capacity_2+gu0.capacity_3))+((gu0.capacity_4+gu0.capacity_5)+(gu0.capacity_6+gu0.capa...2923
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12958157881137742989
[2024-05-21 18:11:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12958157881137742989
Running compilation step : cd /tmp/ltsmin12958157881137742989;'/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 146 ms.
Running link step : cd /tmp/ltsmin12958157881137742989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12958157881137742989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||((!(LTLAPp0==true) U (LTLAPp1==true))&&((LTLAPp0==true)||X((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-06 finished in 95718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(F(p1)))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:11:43] [INFO ] Invariant cache hit.
[2024-05-21 18:11:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 18:11:43] [INFO ] Invariant cache hit.
[2024-05-21 18:11:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:11:43] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-21 18:11:43] [INFO ] Invariant cache hit.
[2024-05-21 18:11:43] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 199 ms.
Product exploration explored 100000 steps with 0 reset in 263 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 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 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1437 ) properties (out of 2) seen :1
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=400 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 116 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 174 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-21 18:11:45] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-05-21 18:11:45] [INFO ] Invariant cache hit.
[2024-05-21 18:11:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 18:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 18:11:45] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-07 finished in 1785 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 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:11:45] [INFO ] Invariant cache hit.
[2024-05-21 18:11:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 18:11:45] [INFO ] Invariant cache hit.
[2024-05-21 18:11:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:11:45] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-21 18:11:45] [INFO ] Invariant cache hit.
[2024-05-21 18:11:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GT 2 (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62)), p0:(OR (LEQ 2 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 373 ms.
Product exploration explored 100000 steps with 0 reset in 413 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(X (X (NOT p1)))
Knowledge based reduction with 3 factoid took 289 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-08 finished in 1325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:11:46] [INFO ] Invariant cache hit.
[2024-05-21 18:11:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 18:11:46] [INFO ] Invariant cache hit.
[2024-05-21 18:11:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:11:46] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-21 18:11:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 18:11:46] [INFO ] Invariant cache hit.
[2024-05-21 18:11:46] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 264 ms.
Product exploration explored 100000 steps with 0 reset in 513 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 3456 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1728 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-21 18:11:48] [INFO ] Invariant cache hit.
[2024-05-21 18:11:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-10 finished in 1808 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 !p1)||F((p2&&F(p3)))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:11:48] [INFO ] Invariant cache hit.
[2024-05-21 18:11:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 18:11:48] [INFO ] Invariant cache hit.
[2024-05-21 18:11:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:11:48] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-21 18:11:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 18:11:48] [INFO ] Invariant cache hit.
[2024-05-21 18:11:48] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p3))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0) p2 (NOT p3)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=0 dest: 3}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={0} source=0 dest: 4}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={0} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 447 ms.
Product exploration explored 100000 steps with 3 reset in 478 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p3)), (X p3), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 19 factoid took 844 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 6 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND p1 (NOT p3))]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=592 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-21 18:11:51] [INFO ] Invariant cache hit.
[2024-05-21 18:11:51] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:6
[2024-05-21 18:11:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-21 18:11:51] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 9 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND p2 (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND p2 (NOT p3) p0 p1))), (G (NOT (AND (NOT p3) (NOT p0) p1))), (G (NOT (AND p2 (NOT p3)))), (G (NOT (AND p2 (NOT p3) (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND (NOT p3) (NOT p0)))), (G (NOT (AND p2 (NOT p3) p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p3)), (X p3), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (F (NOT (AND (NOT p2) p0))), (F p2), (F (NOT (AND (NOT p3) p0 p1))), (F p3), (F (NOT (AND (NOT p3) p0))), (F (NOT (AND (NOT p2) p0 p1)))]
Knowledge based reduction with 28 factoid took 1197 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p2) p1)]
[2024-05-21 18:11:53] [INFO ] Invariant cache hit.
Proved EG (AND (NOT p2) p1)
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND p2 (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND p2 (NOT p3) p0 p1))), (G (NOT (AND (NOT p3) (NOT p0) p1))), (G (NOT (AND p2 (NOT p3)))), (G (NOT (AND p2 (NOT p3) (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND (NOT p3) (NOT p0)))), (G (NOT (AND p2 (NOT p3) p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 p0 (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p3)), (X p3), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (F (NOT (AND (NOT p2) p0))), (F p2), (F (NOT (AND (NOT p3) p0 p1))), (F p3), (F (NOT (AND (NOT p3) p0))), (F (NOT (AND (NOT p2) p0 p1))), (G (AND (NOT p2) p1))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p2) p1))
Knowledge based reduction with 28 factoid took 1222 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-11 finished in 6010 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||X((X((G(!p1)||(!p1&&F(!p0)))) U (p0&&X((G(!p1)||(!p1&&F(!p0)))))))))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:11:54] [INFO ] Invariant cache hit.
[2024-05-21 18:11:54] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 18:11:54] [INFO ] Invariant cache hit.
[2024-05-21 18:11:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:11:54] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-21 18:11:54] [INFO ] Invariant cache hit.
[2024-05-21 18:11:54] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 257 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 6811 steps, including 2 resets, run visited all 3 properties in 4 ms. (steps per millisecond=1702 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F p1)]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:11:55] [INFO ] Invariant cache hit.
[2024-05-21 18:11:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 18:11:56] [INFO ] Invariant cache hit.
[2024-05-21 18:11:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:11:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-21 18:11:56] [INFO ] Invariant cache hit.
[2024-05-21 18:11:56] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 101 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F p1)]
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 192 ms.
Product exploration explored 100000 steps with 0 reset in 236 ms.
Built C files in :
/tmp/ltsmin913320707331498682
[2024-05-21 18:11:57] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin913320707331498682
Running compilation step : cd /tmp/ltsmin913320707331498682;'/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 149 ms.
Running link step : cd /tmp/ltsmin913320707331498682;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin913320707331498682;'/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/stateBased8611418675412004739.hoa' '--buchi-type=spotba'
LTSmin run took 157 ms.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-13 finished in 3360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:11:57] [INFO ] Invariant cache hit.
[2024-05-21 18:11:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 18:11:57] [INFO ] Invariant cache hit.
[2024-05-21 18:11:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:11:57] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-21 18:11:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 18:11:57] [INFO ] Invariant cache hit.
[2024-05-21 18:11:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 228 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:11:59] [INFO ] Invariant cache hit.
[2024-05-21 18:11:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 18:11:59] [INFO ] Invariant cache hit.
[2024-05-21 18:11:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:11:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-21 18:11:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 18:11:59] [INFO ] Invariant cache hit.
[2024-05-21 18:11:59] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5032 ) properties (out of 1) seen :0
Finished Best-First random walk after 204 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=204 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 202 ms.
Product exploration explored 100000 steps with 0 reset in 230 ms.
Built C files in :
/tmp/ltsmin8411342200824119254
[2024-05-21 18:12:00] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 18:12:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:12:00] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 18:12:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:12:00] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 18:12:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:12:00] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8411342200824119254
Running compilation step : cd /tmp/ltsmin8411342200824119254;'/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 145 ms.
Running link step : cd /tmp/ltsmin8411342200824119254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8411342200824119254;'/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/stateBased16619787716456214595.hoa' '--buchi-type=spotba'
LTSmin run took 228 ms.
FORMULA CryptoMiner-COL-D20N100-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D20N100-LTLCardinality-15 finished in 2626 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||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&(!p0 U p1))))))'
[2024-05-21 18:12:00] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
[2024-05-21 18:12:00] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin14829108057851880833
[2024-05-21 18:12:00] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 18:12:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:12:00] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 18:12:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:12:00] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:12:00] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 18:12:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:12:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14829108057851880833
Running compilation step : cd /tmp/ltsmin14829108057851880833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16843024254369460282.txt' '-o' '/tmp/graph16843024254369460282.bin' '-w' '/tmp/graph16843024254369460282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16843024254369460282.bin' '-l' '-1' '-v' '-w' '/tmp/graph16843024254369460282.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:12:00] [INFO ] Decomposing Gal with order
[2024-05-21 18:12:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:12:00] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:12:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 18:12:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality5160390005089330416.gal : 2 ms
[2024-05-21 18:12:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality5859264115358253304.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5160390005089330416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5859264115358253304.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X((("((((((gu1.capacity_0+gu1.capacity_1)+(gu1.capacity_2+gu1.capacity_3))+((gu1.capacity_4+gu1.capacity_5)+(gu1.capacity_6+gu1.cap...5900
Formula 0 simplified : X((!"((((((gu1.capacity_0+gu1.capacity_1)+(gu1.capacity_2+gu1.capacity_3))+((gu1.capacity_4+gu1.capacity_5)+(gu1.capacity_6+gu1.capa...2923
Compilation finished in 177 ms.
Running link step : cd /tmp/ltsmin14829108057851880833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14829108057851880833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu0.t42, gu0.t43, gu0.t44, gu0.t45, gu0.t46, gu0.t47, gu0.t48, gu0.t49, gu0.t50, gu0.t51, gu0...349
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: LTL layer: formula: X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: "X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.075: DFS-FIFO for weak LTL, using special progress label 66
pins2lts-mc-linux64( 0/ 8), 0.075: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.075: State length is 64, there are 71 groups
pins2lts-mc-linux64( 0/ 8), 0.075: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.075: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.075: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.075: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.083: ~1 levels ~960 states ~3232 transitions
pins2lts-mc-linux64( 1/ 8), 0.088: ~1 levels ~1920 states ~7048 transitions
pins2lts-mc-linux64( 1/ 8), 0.114: ~1 levels ~3840 states ~14432 transitions
pins2lts-mc-linux64( 1/ 8), 0.169: ~1 levels ~7680 states ~30080 transitions
pins2lts-mc-linux64( 7/ 8), 0.261: ~1 levels ~15360 states ~59976 transitions
pins2lts-mc-linux64( 7/ 8), 0.406: ~1 levels ~30720 states ~121864 transitions
pins2lts-mc-linux64( 7/ 8), 0.717: ~1 levels ~61440 states ~249168 transitions
pins2lts-mc-linux64( 7/ 8), 1.186: ~1 levels ~122880 states ~510456 transitions
pins2lts-mc-linux64( 7/ 8), 1.870: ~1 levels ~245760 states ~1042984 transitions
pins2lts-mc-linux64( 7/ 8), 2.812: ~1 levels ~491520 states ~2122456 transitions
pins2lts-mc-linux64( 7/ 8), 4.041: ~1 levels ~983040 states ~4381976 transitions
pins2lts-mc-linux64( 7/ 8), 6.118: ~1 levels ~1966080 states ~9084584 transitions
pins2lts-mc-linux64( 7/ 8), 10.305: ~1 levels ~3932160 states ~18876992 transitions
pins2lts-mc-linux64( 7/ 8), 21.750: ~1 levels ~7864320 states ~38921824 transitions
pins2lts-mc-linux64( 2/ 8), 45.696: ~1 levels ~15728640 states ~82769112 transitions
pins2lts-mc-linux64( 7/ 8), 96.228: ~1 levels ~31457280 states ~163113192 transitions
pins2lts-mc-linux64( 7/ 8), 179.721: ~1 levels ~62914560 states ~340998144 transitions
pins2lts-mc-linux64( 2/ 8), 208.779: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 208.808:
pins2lts-mc-linux64( 0/ 8), 208.808: mean standard work distribution: 10.9% (states) 4.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 208.808:
pins2lts-mc-linux64( 0/ 8), 208.808: Explored 63336793 states 395600313 transitions, fanout: 6.246
pins2lts-mc-linux64( 0/ 8), 208.808: Total exploration time 208.720 sec (208.670 sec minimum, 208.697 sec on average)
pins2lts-mc-linux64( 0/ 8), 208.808: States per second: 303453, Transitions per second: 1895364
pins2lts-mc-linux64( 0/ 8), 208.808:
pins2lts-mc-linux64( 0/ 8), 208.808: Progress states detected: 78758864
pins2lts-mc-linux64( 0/ 8), 208.808: Redundant explorations: -19.5814
pins2lts-mc-linux64( 0/ 8), 208.808:
pins2lts-mc-linux64( 0/ 8), 208.808: Queue width: 8B, total height: 29425940, memory: 224.50MB
pins2lts-mc-linux64( 0/ 8), 208.808: Tree memory: 856.9MB, 11.4 B/state, compr.: 4.4%
pins2lts-mc-linux64( 0/ 8), 208.808: Tree fill ratio (roots/leafs): 58.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 208.808: Stored 64 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 208.808: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 208.808: Est. total memory use: 1081.4MB (~1248.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14829108057851880833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14829108057851880833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Computing Next relation with stutter on 1.07042e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-21 18:32:40] [INFO ] Applying decomposition
[2024-05-21 18:32:40] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:32:40] [INFO ] Decomposing Gal with order
[2024-05-21 18:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:32:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 18:32:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality17455196815509408848.gal : 3 ms
[2024-05-21 18:32:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality10750187089162523784.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17455196815509408848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10750187089162523784.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X((("((((((gCD0.capacity_0+gCD1.capacity_1)+(gCD2.capacity_2+gCD3.capacity_3))+((gCD4.capacity_4+gCD5.capacity_5)+(gCD6.capacity_6+...6412
Formula 0 simplified : X((!"((((((gCD0.capacity_0+gCD1.capacity_1)+(gCD2.capacity_2+gCD3.capacity_3))+((gCD4.capacity_4+gCD5.capacity_5)+(gCD6.capacity_6+g...3179
Reverse transition relation is NOT exact ! Due to transitions gCD20.t62, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...271
Computing Next relation with stutter on 1.07042e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-21 18:53:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:53:20] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-21 18:53:20] [INFO ] Transformed 63 places.
[2024-05-21 18:53:20] [INFO ] Transformed 63 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 18:53:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality12697394470940169676.gal : 3 ms
[2024-05-21 18:53:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality14808642403672320793.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12697394470940169676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14808642403672320793.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((("((((((capacity_0+capacity_1)+(capacity_2+capacity_3))+((capacity_4+capacity_5)+(capacity_6+capacity_7)))+(((capacity_8+capacit...4556
Formula 0 simplified : X((!"((((((capacity_0+capacity_1)+(capacity_2+capacity_3))+((capacity_4+capacity_5)+(capacity_6+capacity_7)))+(((capacity_8+capacity...2251
Reverse transition relation is NOT exact ! Due to transitions t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60...265
Computing Next relation with stutter on 1.07042e+08 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13271800 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039176 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-COL-D20N100"
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-D20N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208100222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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