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.r521-tall-167987246300204.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 ltsminxred
Input is CryptoMiner-PT-D10N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246300204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 32K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 214K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680891324469

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 18:15:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:15:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:15:31] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-04-07 18:15:31] [INFO ] Transformed 33 places.
[2023-04-07 18:15:31] [INFO ] Transformed 33 transitions.
[2023-04-07 18:15:31] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 49 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 48 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:15:32] [INFO ] Computed 0 invariants in 29 ms
[2023-04-07 18:15:32] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-04-07 18:15:32] [INFO ] Invariant cache hit.
[2023-04-07 18:15:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:32] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-04-07 18:15:32] [INFO ] Invariant cache hit.
[2023-04-07 18:15:33] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1013 ms. Remains : 32/33 places, 33/33 transitions.
Support contains 22 out of 32 places after structural reductions.
[2023-04-07 18:15:33] [INFO ] Flatten gal took : 22 ms
[2023-04-07 18:15:33] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:15:33] [INFO ] Input system was already deterministic with 33 transitions.
Finished random walk after 952 steps, including 3 resets, run visited all 15 properties in 11 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CryptoMiner-PT-D10N100-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
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 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 6 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:34] [INFO ] Invariant cache hit.
[2023-04-07 18:15:34] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-04-07 18:15:34] [INFO ] Invariant cache hit.
[2023-04-07 18:15:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:34] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-04-07 18:15:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:15:34] [INFO ] Invariant cache hit.
[2023-04-07 18:15:34] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 390 ms. Remains : 32/32 places, 33/33 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 464 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-00 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 (LT s0 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 438 ms.
Product exploration explored 100000 steps with 0 reset in 438 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
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 403 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 100 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 360 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 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
[2023-04-07 18:15:37] [INFO ] Invariant cache hit.
[2023-04-07 18:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:37] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-04-07 18:15:37] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:37] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-04-07 18:15:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 17 ms returned sat
[2023-04-07 18:15:37] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 13 ms.
[2023-04-07 18:15:37] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:37] [INFO ] Invariant cache hit.
[2023-04-07 18:15:37] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-04-07 18:15:37] [INFO ] Invariant cache hit.
[2023-04-07 18:15:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:37] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-04-07 18:15:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:15:37] [INFO ] Invariant cache hit.
[2023-04-07 18:15:37] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 453 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 66 ms :[(NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(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 310 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 88 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
[2023-04-07 18:15:38] [INFO ] Invariant cache hit.
[2023-04-07 18:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-04-07 18:15:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:15:39] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-04-07 18:15:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 18:15:39] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 18:15:39] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 305 ms.
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 14 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:39] [INFO ] Invariant cache hit.
[2023-04-07 18:15:39] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-04-07 18:15:39] [INFO ] Invariant cache hit.
[2023-04-07 18:15:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:40] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-04-07 18:15:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:15:40] [INFO ] Invariant cache hit.
[2023-04-07 18:15:40] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 366 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-00 finished in 6076 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 10 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 11 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 4 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-04-07 18:15:40] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:15:40] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-04-07 18:15:40] [INFO ] Invariant cache hit.
[2023-04-07 18:15:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:40] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-04-07 18:15:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:15:40] [INFO ] Invariant cache hit.
[2023-04-07 18:15:40] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s21 1) (GEQ s11 1) (GEQ s12 1) (GEQ s14 1) (GEQ s15 1) (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-01 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p1)))||X(G((F(G(p0))&&p2)))))'
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:15:40] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 18:15:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-04-07 18:15:40] [INFO ] Invariant cache hit.
[2023-04-07 18:15:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:40] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-04-07 18:15:40] [INFO ] Invariant cache hit.
[2023-04-07 18:15:40] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p2:(AND (GEQ s0 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-02 finished in 783 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)&&(G(p0)||X(X(p1)))))))'
Support contains 21 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:41] [INFO ] Invariant cache hit.
[2023-04-07 18:15:41] [INFO ] Implicit Places using invariants in 526 ms returned []
[2023-04-07 18:15:41] [INFO ] Invariant cache hit.
[2023-04-07 18:15:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:42] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2023-04-07 18:15:42] [INFO ] Invariant cache hit.
[2023-04-07 18:15:42] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1074 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 744 ms :[p0, (NOT p1), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=7, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p1:(OR (GEQ s31 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 287 ms.
Stack based approach found an accepted trace after 351 steps with 0 reset with depth 352 and stack size 352 in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-03 finished in 2124 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||G(F(p0)))))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 13 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:43] [INFO ] Invariant cache hit.
[2023-04-07 18:15:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-04-07 18:15:43] [INFO ] Invariant cache hit.
[2023-04-07 18:15:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:43] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-04-07 18:15:43] [INFO ] Invariant cache hit.
[2023-04-07 18:15:43] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 291 ms.
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 28 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-05 finished in 973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 20 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 2 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-04-07 18:15:44] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 18:15:44] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-04-07 18:15:44] [INFO ] Invariant cache hit.
[2023-04-07 18:15:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:45] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-04-07 18:15:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:15:45] [INFO ] Invariant cache hit.
[2023-04-07 18:15:45] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s13 1)], 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 18 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-07 finished in 1019 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) U F(((!G(X(p1))&&X(p0)) U p1))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 19 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 2 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
[2023-04-07 18:15:45] [INFO ] Invariant cache hit.
[2023-04-07 18:15:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-04-07 18:15:45] [INFO ] Invariant cache hit.
[2023-04-07 18:15:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:45] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-04-07 18:15:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:15:45] [INFO ] Invariant cache hit.
[2023-04-07 18:15:45] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s21 1)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-09 finished in 374 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))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 18:15:45] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:15:45] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-04-07 18:15:45] [INFO ] Invariant cache hit.
[2023-04-07 18:15:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:45] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-04-07 18:15:45] [INFO ] Invariant cache hit.
[2023-04-07 18:15:46] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, (AND p1 p0), p1, (AND p1 p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s23 1), p0:(OR (LT s0 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-10 finished in 555 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)&&(!p0||G(p2)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:46] [INFO ] Invariant cache hit.
[2023-04-07 18:15:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-04-07 18:15:46] [INFO ] Invariant cache hit.
[2023-04-07 18:15:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:46] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-04-07 18:15:46] [INFO ] Invariant cache hit.
[2023-04-07 18:15:46] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), (NOT p1), true, (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(GEQ s0 1), p1:(GEQ s24 1), p2:(LT s30 1)], 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, null, null][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-D10N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-11 finished in 736 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||G(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:47] [INFO ] Invariant cache hit.
[2023-04-07 18:15:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-04-07 18:15:47] [INFO ] Invariant cache hit.
[2023-04-07 18:15:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:47] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-04-07 18:15:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:15:47] [INFO ] Invariant cache hit.
[2023-04-07 18:15:47] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s23 1), p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6 reset in 125 ms.
Product exploration explored 100000 steps with 2 reset in 120 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1020 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=204 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 409 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:48] [INFO ] Invariant cache hit.
[2023-04-07 18:15:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-04-07 18:15:48] [INFO ] Invariant cache hit.
[2023-04-07 18:15:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:49] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2023-04-07 18:15:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:15:49] [INFO ] Invariant cache hit.
[2023-04-07 18:15:49] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 896 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 212 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 104 ms.
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 28 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:51] [INFO ] Invariant cache hit.
[2023-04-07 18:15:51] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-04-07 18:15:51] [INFO ] Invariant cache hit.
[2023-04-07 18:15:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:51] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2023-04-07 18:15:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:15:51] [INFO ] Invariant cache hit.
[2023-04-07 18:15:51] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 791 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-13 finished in 4705 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(X(X((p1||X(p2))))) U (!p0&&X(X(X((p1||X(p2))))))))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:15:51] [INFO ] Invariant cache hit.
[2023-04-07 18:15:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-04-07 18:15:51] [INFO ] Invariant cache hit.
[2023-04-07 18:15:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:15:51] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-04-07 18:15:52] [INFO ] Invariant cache hit.
[2023-04-07 18:15:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 1097 ms :[p0, p0, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 6}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 9}, { cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=(NOT p1), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 12}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 1}, { cond=(NOT p2), acceptance={} source=9 dest: 2}], [{ cond=(NOT p2), acceptance={} source=10 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=10 dest: 4}], [{ cond=(NOT p2), acceptance={} source=11 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=11 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=12 dest: 6}, { cond=(NOT p2), acceptance={} source=12 dest: 7}]], initial=0, aps=[p0:(LT s23 1), p1:(GEQ s22 1), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10656 reset in 61 ms.
Product exploration explored 100000 steps with 10636 reset in 70 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 943 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 42 states, 160 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 4250 ms :[p0, p0, (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), false, (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10036 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=323 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 18:15:58] [INFO ] Invariant cache hit.
[2023-04-07 18:15:59] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 18:15:59] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (OR p1 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 p0 p2)), (F (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (F (OR p1 (NOT p0) p2)), (F (OR (AND p1 p0) (AND p0 p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 3643 ms. Reduced automaton from 42 states, 160 edges and 3 AP (stutter insensitive) to 30 states, 135 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 3103 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 3269 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
[2023-04-07 18:16:09] [INFO ] Invariant cache hit.
[2023-04-07 18:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:16:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-04-07 18:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:16:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-04-07 18:16:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:16:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 18:16:09] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 18:16:09] [INFO ] Added : 23 causal constraints over 5 iterations in 40 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:16:09] [INFO ] Invariant cache hit.
[2023-04-07 18:16:09] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-04-07 18:16:09] [INFO ] Invariant cache hit.
[2023-04-07 18:16:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:16:09] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-04-07 18:16:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:16:09] [INFO ] Invariant cache hit.
[2023-04-07 18:16:09] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p1 p0) p2)), (X (NOT (OR (AND p1 p0) p2))), (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (OR p1 (AND p0 p2))), (X (NOT (OR p1 (AND p0 p2)))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND p1 p0) p2))), (X (X (NOT (OR (AND p1 p0) p2)))), (X (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (OR p1 (AND p0 p2)))), (X (X (NOT (OR p1 (AND p0 p2)))))]
Knowledge based reduction with 15 factoid took 10988 ms. Reduced automaton from 30 states, 135 edges and 3 AP (stutter insensitive) to 30 states, 135 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 2819 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 18:16:24] [INFO ] Invariant cache hit.
[2023-04-07 18:16:24] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 18:16:24] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p1 p0) p2)), (X (NOT (OR (AND p1 p0) p2))), (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (OR p1 (AND p0 p2))), (X (NOT (OR p1 (AND p0 p2)))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND p1 p0) p2))), (X (X (NOT (OR (AND p1 p0) p2)))), (X (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (OR p1 (AND p0 p2)))), (X (X (NOT (OR p1 (AND p0 p2))))), (F (OR p1 p2)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) p0 p2)), (F (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (F (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))), (F (OR (AND p1 p0) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)), (F (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (OR p1 (AND p0 p2))), (F (AND p1 p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (F (AND p1 p0 p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 17 factoid took 17109 ms. Reduced automaton from 30 states, 135 edges and 3 AP (stutter insensitive) to 30 states, 135 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 2881 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 2415 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
[2023-04-07 18:16:47] [INFO ] Invariant cache hit.
[2023-04-07 18:16:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:16:47] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2023-04-07 18:16:47] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:16:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:16:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-04-07 18:16:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:16:47] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 18:16:47] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 6 ms.
[2023-04-07 18:16:47] [INFO ] Added : 23 causal constraints over 5 iterations in 51 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 3052 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Product exploration explored 100000 steps with 9339 reset in 147 ms.
Stack based approach found an accepted trace after 51069 steps with 4912 reset with depth 28 and stack size 28 in 76 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-14 finished in 59081 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 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 6 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:16:50] [INFO ] Invariant cache hit.
[2023-04-07 18:16:50] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-04-07 18:16:50] [INFO ] Invariant cache hit.
[2023-04-07 18:16:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:16:51] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-04-07 18:16:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:16:51] [INFO ] Invariant cache hit.
[2023-04-07 18:16:51] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-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:(AND (GEQ s4 1) (OR (LT s0 1) (LT s21 1)))], 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 8460 reset in 110 ms.
Product exploration explored 100000 steps with 8290 reset in 97 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.9 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 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 150 ms :[(NOT p0), (NOT p0)]
Finished 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 179 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 141 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
[2023-04-07 18:16:52] [INFO ] Invariant cache hit.
[2023-04-07 18:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:16:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-04-07 18:16:52] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:16:52] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-04-07 18:16:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:16:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 18:16:52] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 18:16:52] [INFO ] Added : 23 causal constraints over 5 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:16:52] [INFO ] Invariant cache hit.
[2023-04-07 18:16:52] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-04-07 18:16:52] [INFO ] Invariant cache hit.
[2023-04-07 18:16:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:16:52] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-04-07 18:16:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:16:52] [INFO ] Invariant cache hit.
[2023-04-07 18:16:52] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
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 223 ms :[(NOT p0), (NOT p0)]
Finished random walk after 207 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=207 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 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 124 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
[2023-04-07 18:16:53] [INFO ] Invariant cache hit.
[2023-04-07 18:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 18:16:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-04-07 18:16:53] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 18:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 18:16:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-04-07 18:16:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:16:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 18:16:53] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 18:16:53] [INFO ] Added : 23 causal constraints over 5 iterations in 53 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8342 reset in 57 ms.
Product exploration explored 100000 steps with 8345 reset in 95 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 13 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 18:16:53] [INFO ] Invariant cache hit.
[2023-04-07 18:16:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-04-07 18:16:54] [INFO ] Invariant cache hit.
[2023-04-07 18:16:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:16:54] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-04-07 18:16:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:16:54] [INFO ] Invariant cache hit.
[2023-04-07 18:16:54] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 32/32 places, 33/33 transitions.
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-15 finished in 3302 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' '!(G(F((p0||G(p1)))))'
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)))'
[2023-04-07 18:16:55] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:16:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 18:16:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 33 transitions and 96 arcs took 0 ms.
Total runtime 84203 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2483/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2483/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2483/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CryptoMiner-PT-D10N100-LTLFireability-00
Could not compute solution for formula : CryptoMiner-PT-D10N100-LTLFireability-13
Could not compute solution for formula : CryptoMiner-PT-D10N100-LTLFireability-15

BK_STOP 1680891417142

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CryptoMiner-PT-D10N100-LTLFireability-00
ltl formula formula --ltl=/tmp/2483/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 33 transitions and 96 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2483/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2483/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2483/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2483/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CryptoMiner-PT-D10N100-LTLFireability-13
ltl formula formula --ltl=/tmp/2483/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 33 transitions and 96 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2483/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2483/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2483/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2483/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5652f5ee63f4]
1: pnml2lts-mc(+0xa2496) [0x5652f5ee6496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f06a05b8140]
3: pnml2lts-mc(+0x405be5) [0x5652f6249be5]
4: pnml2lts-mc(+0x16b3f9) [0x5652f5faf3f9]
5: pnml2lts-mc(+0x164ac4) [0x5652f5fa8ac4]
6: pnml2lts-mc(+0x272e0a) [0x5652f60b6e0a]
7: pnml2lts-mc(+0xb61f0) [0x5652f5efa1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f06a040b4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f06a040b67a]
10: pnml2lts-mc(+0xa1581) [0x5652f5ee5581]
11: pnml2lts-mc(+0xa1910) [0x5652f5ee5910]
12: pnml2lts-mc(+0xa32a2) [0x5652f5ee72a2]
13: pnml2lts-mc(+0xa50f4) [0x5652f5ee90f4]
14: pnml2lts-mc(+0x3f34b3) [0x5652f62374b3]
15: pnml2lts-mc(+0x7c63d) [0x5652f5ec063d]
16: pnml2lts-mc(+0x67d86) [0x5652f5eabd86]
17: pnml2lts-mc(+0x60a8a) [0x5652f5ea4a8a]
18: pnml2lts-mc(+0x5eb15) [0x5652f5ea2b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f06a03f3d0a]
20: pnml2lts-mc(+0x6075e) [0x5652f5ea475e]
ltl formula name CryptoMiner-PT-D10N100-LTLFireability-15
ltl formula formula --ltl=/tmp/2483/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 33 transitions and 96 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2483/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2483/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2483/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2483/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CryptoMiner-PT-D10N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CryptoMiner-PT-D10N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246300204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D10N100.tgz
mv CryptoMiner-PT-D10N100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;