fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r519-tall-167987244900171
Last Updated
May 14, 2023

About the Execution of LoLa+red for CryptoMiner-PT-D05N000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1109.388 21840.00 28883.00 519.70 F??FTFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r519-tall-167987244900171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CryptoMiner-PT-D05N000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244900171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 12K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 21K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 156K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.1K Mar 31 16:48 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D05N000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680841622924

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D05N000
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 04:27:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 04:27:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:27:04] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 04:27:04] [INFO ] Transformed 12 places.
[2023-04-07 04:27:04] [INFO ] Transformed 12 transitions.
[2023-04-07 04:27:04] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 04:27:04] [INFO ] Computed 0 invariants in 3 ms
[2023-04-07 04:27:04] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-04-07 04:27:04] [INFO ] Invariant cache hit.
[2023-04-07 04:27:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:04] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-04-07 04:27:04] [INFO ] Invariant cache hit.
[2023-04-07 04:27:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 04:27:05] [INFO ] Flatten gal took : 12 ms
[2023-04-07 04:27:05] [INFO ] Flatten gal took : 3 ms
[2023-04-07 04:27:05] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 1078 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 22) seen :17
Incomplete Best-First random walk after 10001 steps, including 672 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1111 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 761 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-04-07 04:27:05] [INFO ] Invariant cache hit.
[2023-04-07 04:27:05] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 04:27:06] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 27 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(p0 U X(X(!p0)))))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:06] [INFO ] Invariant cache hit.
[2023-04-07 04:27:06] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 04:27:06] [INFO ] Invariant cache hit.
[2023-04-07 04:27:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-07 04:27:06] [INFO ] Invariant cache hit.
[2023-04-07 04:27:06] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 12/12 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 398 ms :[p0, false, false, p0, false, true]
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 3 reset in 2 ms.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-00 finished in 530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:06] [INFO ] Invariant cache hit.
[2023-04-07 04:27:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 04:27:06] [INFO ] Invariant cache hit.
[2023-04-07 04:27:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:06] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 04:27:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:27:06] [INFO ] Invariant cache hit.
[2023-04-07 04:27:06] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ (ADD s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3 s4 s5)) (LEQ 2 (ADD s0 s1 s2 s3 s4 s5)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11636 reset in 260 ms.
Product exploration explored 100000 steps with 11585 reset in 154 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 27 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 200 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-04-07 04:27:07] [INFO ] Invariant cache hit.
[2023-04-07 04:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:27:07] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-07 04:27:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:07] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 04:27:07] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 04:27:07] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:07] [INFO ] Invariant cache hit.
[2023-04-07 04:27:07] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-04-07 04:27:07] [INFO ] Invariant cache hit.
[2023-04-07 04:27:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:07] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-04-07 04:27:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:27:07] [INFO ] Invariant cache hit.
[2023-04-07 04:27:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 27 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 114 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 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 149 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-04-07 04:27:08] [INFO ] Invariant cache hit.
[2023-04-07 04:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:27:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-07 04:27:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:08] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 04:27:08] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-07 04:27:08] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11631 reset in 85 ms.
Product exploration explored 100000 steps with 11671 reset in 199 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:08] [INFO ] Invariant cache hit.
[2023-04-07 04:27:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 04:27:08] [INFO ] Invariant cache hit.
[2023-04-07 04:27:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:08] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 04:27:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:27:08] [INFO ] Invariant cache hit.
[2023-04-07 04:27:08] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-01 finished in 2002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 04:27:08] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 04:27:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 04:27:08] [INFO ] Invariant cache hit.
[2023-04-07 04:27:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:08] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-07 04:27:08] [INFO ] Invariant cache hit.
[2023-04-07 04:27:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 11637 reset in 104 ms.
Product exploration explored 100000 steps with 11598 reset in 97 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/11 stabilizing places and 6/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-04-07 04:27:09] [INFO ] Invariant cache hit.
[2023-04-07 04:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:27:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 04:27:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:09] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 04:27:09] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 04:27:09] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:09] [INFO ] Invariant cache hit.
[2023-04-07 04:27:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 04:27:09] [INFO ] Invariant cache hit.
[2023-04-07 04:27:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:09] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-04-07 04:27:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:27:09] [INFO ] Invariant cache hit.
[2023-04-07 04:27:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/11 stabilizing places and 6/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 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 33 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 87 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-04-07 04:27:09] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:27:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-07 04:27:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:10] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2023-04-07 04:27:10] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 04:27:10] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11648 reset in 57 ms.
Product exploration explored 100000 steps with 11707 reset in 63 ms.
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 04:27:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-02 finished in 1540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 04:27:10] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-04-07 04:27:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5) (ADD s6 s7 s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 2 reset in 1 ms.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-03 finished in 113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-04-07 04:27:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 12/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), p0]
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 33 steps with 4 reset in 1 ms.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-06 finished in 187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0&&X(p0)) U X(p1)))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-04-07 04:27:10] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s1 s6), p1:(LEQ s4 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72368 steps with 18289 reset in 42 ms.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-09 finished in 319 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(G(p0))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:10] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-07 04:27:10] [INFO ] Invariant cache hit.
[2023-04-07 04:27:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s10 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 1 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-13 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||G(p1)) U X(p2)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:11] [INFO ] Invariant cache hit.
[2023-04-07 04:27:11] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 04:27:11] [INFO ] Invariant cache hit.
[2023-04-07 04:27:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:11] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 04:27:11] [INFO ] Invariant cache hit.
[2023-04-07 04:27:11] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 596 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ 1 s7), p1:(LEQ 3 s2), p2:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-14 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:11] [INFO ] Invariant cache hit.
[2023-04-07 04:27:11] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 04:27:11] [INFO ] Invariant cache hit.
[2023-04-07 04:27:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-07 04:27:11] [INFO ] Invariant cache hit.
[2023-04-07 04:27:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 11/12 places, 12/12 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D05N000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-15 finished in 164 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)))'
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)))'
Found a Shortening insensitive property : CryptoMiner-PT-D05N000-LTLCardinality-02
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 27 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:12] [INFO ] Invariant cache hit.
[2023-04-07 04:27:12] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 04:27:12] [INFO ] Invariant cache hit.
[2023-04-07 04:27:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:12] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 04:27:12] [INFO ] Invariant cache hit.
[2023-04-07 04:27:12] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 68 ms. Remains : 11/12 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-PT-D05N000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 11657 reset in 86 ms.
Product exploration explored 100000 steps with 11687 reset in 96 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/11 stabilizing places and 6/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 112 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-04-07 04:27:12] [INFO ] Invariant cache hit.
[2023-04-07 04:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:27:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-07 04:27:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:12] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 04:27:12] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-07 04:27:12] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:12] [INFO ] Invariant cache hit.
[2023-04-07 04:27:12] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 04:27:12] [INFO ] Invariant cache hit.
[2023-04-07 04:27:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-04-07 04:27:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:27:12] [INFO ] Invariant cache hit.
[2023-04-07 04:27:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/11 stabilizing places and 6/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 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 31 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 133 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-04-07 04:27:13] [INFO ] Invariant cache hit.
[2023-04-07 04:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:27:13] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-07 04:27:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:13] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-07 04:27:13] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 04:27:13] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11669 reset in 52 ms.
Product exploration explored 100000 steps with 11597 reset in 65 ms.
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-07 04:27:13] [INFO ] Invariant cache hit.
[2023-04-07 04:27:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-07 04:27:13] [INFO ] Invariant cache hit.
[2023-04-07 04:27:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:27:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-07 04:27:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:27:13] [INFO ] Invariant cache hit.
[2023-04-07 04:27:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property CryptoMiner-PT-D05N000-LTLCardinality-02 finished in 1483 ms.
[2023-04-07 04:27:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 04:27:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 04:27:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 34 arcs took 0 ms.
Total runtime 9311 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-PT-D05N000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1680841644764

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 CryptoMiner-PT-D05N000-LTLCardinality-01
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: CANCELED task # 1 (type EXCL) for CryptoMiner-PT-D05N000-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D05N000-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D05N000-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 5 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 CryptoMiner-PT-D05N000-LTLCardinality-02
lola: time limit : 3595 sec
lola: memory limit: 32 pages
lola: CANCELED task # 4 (type EXCL) for CryptoMiner-PT-D05N000-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CryptoMiner-PT-D05N000-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
CryptoMiner-PT-D05N000-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D05N000-LTLCardinality-01: LTL unknown AGGR
CryptoMiner-PT-D05N000-LTLCardinality-02: LTL unknown AGGR


Time elapsed: 10 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D05N000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is CryptoMiner-PT-D05N000, 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 r519-tall-167987244900171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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