Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208200263.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CryptoMiner-PT-D10N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208200263
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CryptoMiner-PT-D10N100-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 1716323355806

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 20:29:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:29:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:29:17] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2024-05-21 20:29:17] [INFO ] Transformed 33 places.
[2024-05-21 20:29:17] [INFO ] Transformed 33 transitions.
[2024-05-21 20:29:17] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-10 FALSE 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 9 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2024-05-21 20:29:17] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 20:29:17] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-21 20:29:17] [INFO ] Invariant cache hit.
[2024-05-21 20:29:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:17] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 20:29:17] [INFO ] Invariant cache hit.
[2024-05-21 20:29:17] [INFO ] Dead Transitions using invariants and state equation in 42 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 261 ms. Remains : 32/33 places, 33/33 transitions.
Support contains 22 out of 32 places after structural reductions.
[2024-05-21 20:29:17] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:29:17] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:29:17] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:29:18] [INFO ] Invariant cache hit.
[2024-05-21 20:29:18] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 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 5 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:29:18] [INFO ] Invariant cache hit.
[2024-05-21 20:29:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 20:29:18] [INFO ] Invariant cache hit.
[2024-05-21 20:29:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-21 20:29:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:29:18] [INFO ] Invariant cache hit.
[2024-05-21 20:29:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 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 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-00 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 (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1) (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1) (LT s10 1) (LT s23 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 0 reset in 234 ms.
Stack based approach found an accepted trace after 147 steps with 0 reset with depth 148 and stack size 148 in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-00 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 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 3 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:29:18] [INFO ] Invariant cache hit.
[2024-05-21 20:29:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 20:29:19] [INFO ] Invariant cache hit.
[2024-05-21 20:29:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:19] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-21 20:29:19] [INFO ] Invariant cache hit.
[2024-05-21 20:29:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-01 finished in 209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)||p0))))))'
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 7 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:29:19] [INFO ] Invariant cache hit.
[2024-05-21 20:29:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 20:29:19] [INFO ] Invariant cache hit.
[2024-05-21 20:29:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-21 20:29:19] [INFO ] Invariant cache hit.
[2024-05-21 20:29:19] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GEQ s23 1), p0:(OR (GEQ s23 1) (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 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Product exploration explored 100000 steps with 25000 reset in 113 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/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10045 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2009 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:29:20] [INFO ] Invariant cache hit.
[2024-05-21 20:29:20] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
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.
[2024-05-21 20:29:20] [INFO ] Invariant cache hit.
[2024-05-21 20:29:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 20:29:20] [INFO ] Invariant cache hit.
[2024-05-21 20:29:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:20] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-21 20:29:20] [INFO ] Invariant cache hit.
[2024-05-21 20:29:20] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6791 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2263 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 69 ms.
Product exploration explored 100000 steps with 25000 reset in 69 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 12 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.
[2024-05-21 20:29:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:29:21] [INFO ] Invariant cache hit.
[2024-05-21 20:29:21] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 32/32 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin10716472992026437677
[2024-05-21 20:29:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10716472992026437677
Running compilation step : cd /tmp/ltsmin10716472992026437677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin10716472992026437677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10716472992026437677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15351957209837418878.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-03 finished in 3080 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 2 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.
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s21 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][false, false]]
Product exploration explored 100000 steps with 4 reset in 102 ms.
Stack based approach found an accepted trace after 5717 steps with 0 reset with depth 5718 and stack size 5718 in 6 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-04 finished in 281 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 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 5 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 22 cols
[2024-05-21 20:29:22] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 20:29:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-21 20:29:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] Dead Transitions using invariants and state equation in 25 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 95 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ 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 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-06 finished in 149 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 U (p1||G(!p0))))))'
Support contains 11 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 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 6 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:22] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-21 20:29:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] Dead Transitions using invariants and state equation in 27 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 96 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (GEQ s13 1)) (NOT (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], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-07 finished in 185 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&&(G(p1)||(p1&&F(!p2))))))'
Support contains 4 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 3 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2024-05-21 20:29:22] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 20:29:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:22] [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.
[2024-05-21 20:29:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:29:22] [INFO ] Invariant cache hit.
[2024-05-21 20:29:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s1 1), p1:(LT s2 1), p2:(AND (GEQ s0 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 17472 reset in 114 ms.
Product exploration explored 100000 steps with 17565 reset in 84 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
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2))))]
Knowledge based reduction with 3 factoid took 358 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2006 ) properties (out of 5) seen :4
Finished Best-First random walk after 694 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=694 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (F (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (F (AND (NOT p1) p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND p1 p2))), (F (AND p1 p2 p0))]
Knowledge based reduction with 3 factoid took 447 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
[2024-05-21 20:29:24] [INFO ] Invariant cache hit.
[2024-05-21 20:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:29:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 20:29:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:29:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 20:29:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:29:24] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 20:29:24] [INFO ] Added : 19 causal constraints over 4 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 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.
[2024-05-21 20:29:24] [INFO ] Invariant cache hit.
[2024-05-21 20:29:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 20:29:24] [INFO ] Invariant cache hit.
[2024-05-21 20:29:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:24] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-21 20:29:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:29:24] [INFO ] Invariant cache hit.
[2024-05-21 20:29:24] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 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 : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p0))), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))))]
Knowledge based reduction with 3 factoid took 349 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
Incomplete random walk after 10046 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=3348 ) properties (out of 5) seen :4
Finished Best-First random walk after 599 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=599 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p0))), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))))), (F (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (F (AND (NOT p1) p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND p1 p2))), (F (AND p1 p2 p0))]
Knowledge based reduction with 3 factoid took 516 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
[2024-05-21 20:29:26] [INFO ] Invariant cache hit.
[2024-05-21 20:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:29:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 20:29:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:29:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-21 20:29:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:29:26] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 20:29:26] [INFO ] Added : 19 causal constraints over 4 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 17459 reset in 76 ms.
Product exploration explored 100000 steps with 17495 reset in 110 ms.
Built C files in :
/tmp/ltsmin14195735379034649419
[2024-05-21 20:29:26] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-21 20:29:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:29:26] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-21 20:29:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:29:26] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-21 20:29:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:29:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14195735379034649419
Running compilation step : cd /tmp/ltsmin14195735379034649419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 112 ms.
Running link step : cd /tmp/ltsmin14195735379034649419;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14195735379034649419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14377253801070118164.hoa' '--buchi-type=spotba'
LTSmin run took 64 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-08 finished in 3771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))||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 3 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:29:26] [INFO ] Invariant cache hit.
[2024-05-21 20:29:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 20:29:26] [INFO ] Invariant cache hit.
[2024-05-21 20:29:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:26] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-21 20:29:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:29:26] [INFO ] Invariant cache hit.
[2024-05-21 20:29:26] [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 86 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
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}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s8 1) (GEQ s23 1)), p0:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 117 ms.
Stack based approach found an accepted trace after 5130 steps with 0 reset with depth 5131 and stack size 5131 in 8 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-09 finished in 347 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)) U (p1&&X(G(p0))))))'
Support contains 2 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.
[2024-05-21 20:29:27] [INFO ] Invariant cache hit.
[2024-05-21 20:29:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 20:29:27] [INFO ] Invariant cache hit.
[2024-05-21 20:29:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 20:29:27] [INFO ] Invariant cache hit.
[2024-05-21 20:29:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s23 1), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 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 224 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(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.
[2024-05-21 20:29:27] [INFO ] Invariant cache hit.
[2024-05-21 20:29:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 20:29:27] [INFO ] Invariant cache hit.
[2024-05-21 20:29:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:27] [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.
[2024-05-21 20:29:27] [INFO ] Invariant cache hit.
[2024-05-21 20:29:27] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s21 1)), p0:(LT s30 1)], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Stack based approach found an accepted trace after 1662 steps with 0 reset with depth 1663 and stack size 1663 in 3 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-12 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 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 3 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:29:27] [INFO ] Invariant cache hit.
[2024-05-21 20:29:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 20:29:27] [INFO ] Invariant cache hit.
[2024-05-21 20:29:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 20:29:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:29:27] [INFO ] Invariant cache hit.
[2024-05-21 20:29:27] [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 86 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s23 1) (GEQ s5 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]]
Product exploration explored 100000 steps with 6800 reset in 69 ms.
Product exploration explored 100000 steps with 6756 reset in 88 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
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 39 ms :[(NOT p0)]
Finished random walk after 111 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=111 )
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 69 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 24 ms :[(NOT p0)]
[2024-05-21 20:29:28] [INFO ] Invariant cache hit.
[2024-05-21 20:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:29:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-21 20:29:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:29:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:29:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-21 20:29:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:28] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:29:28] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 20:29:28] [INFO ] Added : 23 causal constraints over 5 iterations in 20 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 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:29:28] [INFO ] Invariant cache hit.
[2024-05-21 20:29:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 20:29:28] [INFO ] Invariant cache hit.
[2024-05-21 20:29:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 20:29:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:29:28] [INFO ] Invariant cache hit.
[2024-05-21 20:29:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 57 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 28 ms :[(NOT p0)]
Finished random walk after 111 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=111 )
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 118 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)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-21 20:29:28] [INFO ] Invariant cache hit.
[2024-05-21 20:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:29:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-21 20:29:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:29:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:29:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-21 20:29:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:28] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:29:28] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 20:29:28] [INFO ] Added : 23 causal constraints over 5 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6844 reset in 68 ms.
Product exploration explored 100000 steps with 6864 reset in 71 ms.
Built C files in :
/tmp/ltsmin6487768045105379375
[2024-05-21 20:29:28] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-21 20:29:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:29:28] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-21 20:29:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:29:28] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-21 20:29:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:29:28] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6487768045105379375
Running compilation step : cd /tmp/ltsmin6487768045105379375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin6487768045105379375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6487768045105379375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8732041010979441141.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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.
[2024-05-21 20:29:44] [INFO ] Invariant cache hit.
[2024-05-21 20:29:44] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 20:29:44] [INFO ] Invariant cache hit.
[2024-05-21 20:29:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:29:44] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-21 20:29:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:29:44] [INFO ] Invariant cache hit.
[2024-05-21 20:29:44] [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 103 ms. Remains : 32/32 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin6484872661610247858
[2024-05-21 20:29:44] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-21 20:29:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:29:44] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-21 20:29:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:29:44] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-21 20:29:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:29:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6484872661610247858
Running compilation step : cd /tmp/ltsmin6484872661610247858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 110 ms.
Running link step : cd /tmp/ltsmin6484872661610247858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6484872661610247858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3409930698004782294.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:29:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:29:59] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:29:59] [INFO ] Time to serialize gal into /tmp/LTL3418139791966917182.gal : 0 ms
[2024-05-21 20:29:59] [INFO ] Time to serialize properties into /tmp/LTL7359853617036007773.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3418139791966917182.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15605448457013118145.hoa' '-atoms' '/tmp/LTL7359853617036007773.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7359853617036007773.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15605448457013118145.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, Intersection with reachable at ea...219
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:30:14] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:30:14] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:30:14] [INFO ] Time to serialize gal into /tmp/LTL3556906945073891772.gal : 1 ms
[2024-05-21 20:30:14] [INFO ] Time to serialize properties into /tmp/LTL9550801453367384529.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3556906945073891772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9550801453367384529.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("((state_c10>=1)||(capacity_c4>=1))")))
Formula 0 simplified : G!"((state_c10>=1)||(capacity_c4>=1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, Intersection with reachable at ea...219
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:30:29] [INFO ] Flatten gal took : 2 ms
[2024-05-21 20:30:29] [INFO ] Applying decomposition
[2024-05-21 20:30:29] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14885107717184858534.txt' '-o' '/tmp/graph14885107717184858534.bin' '-w' '/tmp/graph14885107717184858534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14885107717184858534.bin' '-l' '-1' '-v' '-w' '/tmp/graph14885107717184858534.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:30:29] [INFO ] Decomposing Gal with order
[2024-05-21 20:30:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:30:29] [INFO ] Removed a total of 5 redundant transitions.
[2024-05-21 20:30:29] [INFO ] Flatten gal took : 23 ms
[2024-05-21 20:30:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 20:30:29] [INFO ] Time to serialize gal into /tmp/LTL229370268939197232.gal : 1 ms
[2024-05-21 20:30:29] [INFO ] Time to serialize properties into /tmp/LTL5667497567986440503.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL229370268939197232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5667497567986440503.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F("((i5.u9.state_c10>=1)||(i1.u1.capacity_c4>=1))")))
Formula 0 simplified : G!"((i5.u9.state_c10>=1)||(i1.u1.capacity_c4>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2085525176671187907
[2024-05-21 20:30:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2085525176671187907
Running compilation step : cd /tmp/ltsmin2085525176671187907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin2085525176671187907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2085525176671187907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-14 finished in 92036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(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 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 20:30:59] [INFO ] Invariant cache hit.
[2024-05-21 20:30:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 20:30:59] [INFO ] Invariant cache hit.
[2024-05-21 20:30:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 20:30:59] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-21 20:30:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:30:59] [INFO ] Invariant cache hit.
[2024-05-21 20:30:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s23 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Stack based approach found an accepted trace after 1013 steps with 0 reset with depth 1014 and stack size 1014 in 2 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-15 finished in 314 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))'
[2024-05-21 20:31:00] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin861917922854497599
[2024-05-21 20:31:00] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-21 20:31:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:31:00] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-21 20:31:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:31:00] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-21 20:31:00] [INFO ] Applying decomposition
[2024-05-21 20:31:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:31:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin861917922854497599
Running compilation step : cd /tmp/ltsmin861917922854497599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 20:31:00] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13357668019556831252.txt' '-o' '/tmp/graph13357668019556831252.bin' '-w' '/tmp/graph13357668019556831252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13357668019556831252.bin' '-l' '-1' '-v' '-w' '/tmp/graph13357668019556831252.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:31:00] [INFO ] Decomposing Gal with order
[2024-05-21 20:31:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:31:00] [INFO ] Removed a total of 4 redundant transitions.
[2024-05-21 20:31:00] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:31:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 20:31:00] [INFO ] Time to serialize gal into /tmp/LTLFireability10834394972937912288.gal : 1 ms
[2024-05-21 20:31:00] [INFO ] Time to serialize properties into /tmp/LTLFireability8036502321374006376.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10834394972937912288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8036502321374006376.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("((i3.u11.state_c10>=1)||(i1.u2.capacity_c4>=1))")))
Formula 0 simplified : G!"((i3.u11.state_c10>=1)||(i1.u2.capacity_c4>=1))"
Compilation finished in 110 ms.
Running link step : cd /tmp/ltsmin861917922854497599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin861917922854497599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 34, guards 33
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: LTL layer: formula: <>((LTLAPp0==true))
pins2lts-mc-linux64( 0/ 8), 0.003: "<>((LTLAPp0==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: buchi has 1 states
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.015: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.017: There are 36 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.017: State length is 33, there are 34 groups
pins2lts-mc-linux64( 0/ 8), 0.017: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.017: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.017: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.017: Visible groups: 0 / 34, labels: 1 / 36
pins2lts-mc-linux64( 0/ 8), 0.017: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.017: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.036: [Blue] ~117 levels ~960 states ~2208 transitions
pins2lts-mc-linux64( 3/ 8), 0.043: [Blue] ~115 levels ~1920 states ~3776 transitions
pins2lts-mc-linux64( 3/ 8), 0.065: [Blue] ~119 levels ~3840 states ~6536 transitions
pins2lts-mc-linux64( 1/ 8), 0.092: [Blue] ~120 levels ~7680 states ~13944 transitions
pins2lts-mc-linux64( 1/ 8), 0.135: [Blue] ~123 levels ~15360 states ~26688 transitions
pins2lts-mc-linux64( 1/ 8), 0.223: [Blue] ~125 levels ~30720 states ~52880 transitions
pins2lts-mc-linux64( 1/ 8), 0.367: [Blue] ~127 levels ~61440 states ~108880 transitions
pins2lts-mc-linux64( 1/ 8), 0.729: [Blue] ~131 levels ~122880 states ~227864 transitions
pins2lts-mc-linux64( 1/ 8), 1.170: [Blue] ~132 levels ~245760 states ~460888 transitions
pins2lts-mc-linux64( 1/ 8), 1.895: [Blue] ~135 levels ~491520 states ~943896 transitions
pins2lts-mc-linux64( 1/ 8), 2.828: [Blue] ~139 levels ~983040 states ~1893432 transitions
pins2lts-mc-linux64( 4/ 8), 4.285: [Blue] ~307 levels ~1966080 states ~3608824 transitions
pins2lts-mc-linux64( 0/ 8), 7.234: [Blue] ~305 levels ~3932160 states ~7247384 transitions
pins2lts-mc-linux64( 0/ 8), 12.963: [Blue] ~305 levels ~7864320 states ~14588568 transitions
pins2lts-mc-linux64( 0/ 8), 24.314: [Blue] ~305 levels ~15728640 states ~29035832 transitions
pins2lts-mc-linux64( 0/ 8), 47.145: [Blue] ~305 levels ~31457280 states ~57924208 transitions
pins2lts-mc-linux64( 0/ 8), 94.913: [Blue] ~305 levels ~62914560 states ~117544256 transitions
pins2lts-mc-linux64( 6/ 8), 124.470: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 124.505:
pins2lts-mc-linux64( 0/ 8), 124.505: Explored 73642578 states 154716925 transitions, fanout: 2.101
pins2lts-mc-linux64( 0/ 8), 124.505: Total exploration time 124.470 sec (124.440 sec minimum, 124.451 sec on average)
pins2lts-mc-linux64( 0/ 8), 124.505: States per second: 591649, Transitions per second: 1243006
pins2lts-mc-linux64( 0/ 8), 124.505:
pins2lts-mc-linux64( 0/ 8), 124.505: State space has 73308417 states, 73205429 are accepting
pins2lts-mc-linux64( 0/ 8), 124.505: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 124.505: blue states: 73642578 (100.46%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 124.505: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 124.505: all-red states: 73205429 (99.86%), bogus 313347 (0.43%)
pins2lts-mc-linux64( 0/ 8), 124.505:
pins2lts-mc-linux64( 0/ 8), 124.505: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 124.505:
pins2lts-mc-linux64( 0/ 8), 124.505: Queue width: 8B, total height: 1958, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 124.505: Tree memory: 815.3MB, 11.7 B/state, compr.: 8.7%
pins2lts-mc-linux64( 0/ 8), 124.505: Tree fill ratio (roots/leafs): 54.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 124.505: Stored 33 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 124.505: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 124.505: Est. total memory use: 815.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin861917922854497599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin861917922854497599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions t1, t17, i2.t15, i2.t13, i2.u7.t12, i2.u8.t14, i2.u9.t16, i3.t19, i3.u10.t18, i3.u11.t11, i3....274
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:51:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:51:34] [INFO ] Time to serialize gal into /tmp/LTLFireability3822419905395079453.gal : 2 ms
[2024-05-21 20:51:34] [INFO ] Time to serialize properties into /tmp/LTLFireability8311439244624488746.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3822419905395079453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8311439244624488746.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F("((state_c10>=1)||(capacity_c4>=1))")))
Formula 0 simplified : G!"((state_c10>=1)||(capacity_c4>=1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, Intersection with reachable at ea...219
Computing Next relation with stutter on 1.07187e+07 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
4551 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,45.5253,807140,1,0,1623,4.88702e+06,92,967,2299,4.77334e+06,3173
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 1387266 ms.

BK_STOP 1716324745465

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CryptoMiner-PT-D10N100, examination is 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 r109-tall-171624208200263"
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 ;