MCC'2024- Execution of r109-tall-171624208000193

About the Execution of 2023-gold for CryptoMiner-COL-D03N100

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2463.247	396950.00	1212131.00	664.30	FFFFFFFFTFFTFFFT	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.9K Apr 12 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 12:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716309202958

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-COL-D03N100
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-21 16:33:24] [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 16:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:33:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 16:33:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 16:33:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 641 ms
[2024-05-21 16:33:25] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 12 PT places and 20.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 16:33:25] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 5 ms.
[2024-05-21 16:33:25] [INFO ] Skeletonized 3 HLPN properties in 1 ms. Removed 13 properties that had guard overlaps.
Computed a total of 3 stabilizing places and 3 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2024-05-21 16:33:25] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 34 arcs in 7 ms.
[2024-05-21 16:33:25] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N100-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 7 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 11 cols
[2024-05-21 16:33:25] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 16:33:25] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 16:33:25] [INFO ] Invariant cache hit.
[2024-05-21 16:33:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:25] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-21 16:33:25] [INFO ] Invariant cache hit.
[2024-05-21 16:33:25] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/12 places, 12/12 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 11/12 places, 12/12 transitions.
Support contains 8 out of 11 places after structural reductions.
[2024-05-21 16:33:25] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:33:25] [INFO ] Flatten gal took : 3 ms
[2024-05-21 16:33:25] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 6781 steps, including 2 resets, run visited all 8 properties in 20 ms. (steps per millisecond=339 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(G(p2)||p1)))))'
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:33:26] [INFO ] Invariant cache hit.
[2024-05-21 16:33:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 16:33:26] [INFO ] Invariant cache hit.
[2024-05-21 16:33:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 16:33:26] [INFO ] Invariant cache hit.
[2024-05-21 16:33:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 11/11 places, 12/12 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s4 1) (LT s5 1) (LT s6 1)), p1:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1))), p2:(OR (LT s0 1) (LT s4 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 386 ms.
Product exploration explored 100000 steps with 0 reset in 469 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 484 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false, false]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 16:33:28] [INFO ] Invariant cache hit.
[2024-05-21 16:33:28] [INFO ] After 64ms 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.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p0))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (AND p1 p2 p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))))), (F p0), (F (OR (AND p1 p0) (AND p2 p0))), (F (AND (NOT p1) p2 p0)), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 13 factoid took 1238 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
[2024-05-21 16:33:30] [INFO ] Invariant cache hit.
[2024-05-21 16:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:33:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 16:33:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:30] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 16:33:30] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 16:33:30] [INFO ] Added : 1 causal constraints over 1 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:33:30] [INFO ] Invariant cache hit.
[2024-05-21 16:33:30] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 16:33:30] [INFO ] Invariant cache hit.
[2024-05-21 16:33:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:30] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-21 16:33:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 16:33:30] [INFO ] Invariant cache hit.
[2024-05-21 16:33:30] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND p1 p2 p0))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X 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 18 factoid took 1027 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 16:33:32] [INFO ] Invariant cache hit.
[2024-05-21 16:33:32] [INFO ] After 30ms 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.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND p1 p2 p0))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p0 (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (OR (AND (NOT p1) p2) (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2) (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X 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 p2), (F p0), (F (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (F (AND p1 p0 p2)), (F (AND (NOT p1) p0 p2)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F (OR (AND p1 p0) (AND p0 p2))), (F (AND (NOT p1) p0)), (F (AND (NOT p0) p2)), (F (AND p1 p0))]
Knowledge based reduction with 20 factoid took 2293 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
[2024-05-21 16:33:34] [INFO ] Invariant cache hit.
[2024-05-21 16:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:33:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 16:33:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:35] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 16:33:35] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 16:33:35] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Built C files in :
/tmp/ltsmin10696936716757600125
[2024-05-21 16:33:35] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 16:33:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:33:35] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 16:33:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:33:35] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 16:33:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:33:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10696936716757600125
Running compilation step : cd /tmp/ltsmin10696936716757600125;'/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 168 ms.
Running link step : cd /tmp/ltsmin10696936716757600125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin10696936716757600125;'/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/stateBased11228491110009999151.hoa' '--buchi-type=spotba'
LTSmin run took 185 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-00 finished in 9946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)&&X(X(F(p1))))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:33:35] [INFO ] Invariant cache hit.
[2024-05-21 16:33:36] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 16:33:36] [INFO ] Invariant cache hit.
[2024-05-21 16:33:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-21 16:33:36] [INFO ] Invariant cache hit.
[2024-05-21 16:33:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 173 ms :[p0, (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-COL-D03N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (LT s0 1) (LT s4 1)), p1:(GEQ s7 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 4 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-01 finished in 267 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(G((!p0&&F(G((F(!p2)||p1)))))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:33:36] [INFO ] Invariant cache hit.
[2024-05-21 16:33:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 16:33:36] [INFO ] Invariant cache hit.
[2024-05-21 16:33:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:36] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-21 16:33:36] [INFO ] Invariant cache hit.
[2024-05-21 16:33:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR p0 (AND (NOT p1) p2)), (OR p0 (AND (NOT p1) p2)), (OR p0 (AND (NOT p1) p2)), (OR p0 (AND (NOT p1) p2)), true, (AND (NOT p1) p2)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LT s4 1) (LT s5 1) (LT s6 1)), p1:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1)), p2:(OR (LT s0 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 18 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-02 finished in 456 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(G(p0)))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:33:36] [INFO ] Invariant cache hit.
[2024-05-21 16:33:36] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 16:33:36] [INFO ] Invariant cache hit.
[2024-05-21 16:33:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:36] [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 16:33:36] [INFO ] Invariant cache hit.
[2024-05-21 16:33:36] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 70 ms.
Product exploration explored 100000 steps with 0 reset in 69 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:33:37] [INFO ] Invariant cache hit.
[2024-05-21 16:33:37] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 16:33:37] [INFO ] Invariant cache hit.
[2024-05-21 16:33:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:37] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 16:33:37] [INFO ] Invariant cache hit.
[2024-05-21 16:33:37] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6777 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3388 )
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 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 52 ms.
Product exploration explored 100000 steps with 0 reset in 116 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:33:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:33:38] [INFO ] Invariant cache hit.
[2024-05-21 16:33:38] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin4215362037698664203
[2024-05-21 16:33:38] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4215362037698664203
Running compilation step : cd /tmp/ltsmin4215362037698664203;'/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 71 ms.
Running link step : cd /tmp/ltsmin4215362037698664203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4215362037698664203;'/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/stateBased5818471533134586196.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:33:53] [INFO ] Invariant cache hit.
[2024-05-21 16:33:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 16:33:54] [INFO ] Invariant cache hit.
[2024-05-21 16:33:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:33:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 16:33:54] [INFO ] Invariant cache hit.
[2024-05-21 16:33:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin12234223797986542150
[2024-05-21 16:33:54] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12234223797986542150
Running compilation step : cd /tmp/ltsmin12234223797986542150;'/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 85 ms.
Running link step : cd /tmp/ltsmin12234223797986542150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin12234223797986542150;'/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/stateBased6262096308412956402.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 16:34:09] [INFO ] Flatten gal took : 2 ms
[2024-05-21 16:34:09] [INFO ] Flatten gal took : 1 ms
[2024-05-21 16:34:09] [INFO ] Time to serialize gal into /tmp/LTL13093050341929278118.gal : 1 ms
[2024-05-21 16:34:09] [INFO ] Time to serialize properties into /tmp/LTL12293134036696875445.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/LTL13093050341929278118.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11222135481999033589.hoa' '-atoms' '/tmp/LTL12293134036696875445.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...320
Loading property file /tmp/LTL12293134036696875445.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11222135481999033589.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:34:24] [INFO ] Flatten gal took : 2 ms
[2024-05-21 16:34:24] [INFO ] Flatten gal took : 5 ms
[2024-05-21 16:34:24] [INFO ] Time to serialize gal into /tmp/LTL3852890001841517647.gal : 2 ms
[2024-05-21 16:34:24] [INFO ] Time to serialize properties into /tmp/LTL1875431059162156313.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/LTL3852890001841517647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1875431059162156313.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))"))))))
Formula 0 simplified : XXXF!"(((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:34:39] [INFO ] Flatten gal took : 2 ms
[2024-05-21 16:34:39] [INFO ] Applying decomposition
[2024-05-21 16:34:39] [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/graph17136479550248613933.txt' '-o' '/tmp/graph17136479550248613933.bin' '-w' '/tmp/graph17136479550248613933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17136479550248613933.bin' '-l' '-1' '-v' '-w' '/tmp/graph17136479550248613933.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:34:39] [INFO ] Decomposing Gal with order
[2024-05-21 16:34:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:34:39] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 16:34:39] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:34:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 16:34:39] [INFO ] Time to serialize gal into /tmp/LTL5163381461458781128.gal : 1 ms
[2024-05-21 16:34:39] [INFO ] Time to serialize properties into /tmp/LTL1712953408553805979.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/LTL5163381461458781128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1712953408553805979.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i0.u1.capacity_0>=1)||(i0.u1.capacity_1>=1))||((i0.u0.capacity_2>=1)||(i0.u0.capacity_3>=1)))"))))))
Formula 0 simplified : XXXF!"(((i0.u1.capacity_0>=1)||(i0.u1.capacity_1>=1))||((i0.u0.capacity_2>=1)||(i0.u0.capacity_3>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12503372987272926105
[2024-05-21 16:34:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12503372987272926105
Running compilation step : cd /tmp/ltsmin12503372987272926105;'/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 78 ms.
Running link step : cd /tmp/ltsmin12503372987272926105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12503372987272926105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-03 finished in 92811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U X((p1&&F(!p0))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:09] [INFO ] Invariant cache hit.
[2024-05-21 16:35:09] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 16:35:09] [INFO ] Invariant cache hit.
[2024-05-21 16:35:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:09] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-21 16:35:09] [INFO ] Invariant cache hit.
[2024-05-21 16:35:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, p0]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s4 1) (LT s5 1) (LT s6 1)), p1:(GEQ s7 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-04 finished in 375 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(p1)||p0)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:09] [INFO ] Invariant cache hit.
[2024-05-21 16:35:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 16:35:09] [INFO ] Invariant cache hit.
[2024-05-21 16:35:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-21 16:35:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:35:09] [INFO ] Invariant cache hit.
[2024-05-21 16:35:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s4 1)), p1:(GEQ s7 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 68 ms.
Product exploration explored 100000 steps with 2 reset in 130 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-21 16:35:10] [INFO ] Invariant cache hit.
[2024-05-21 16:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:35:10] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 16:35:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 16:35:10] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 16:35:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-21 16:35:10] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 16:35:10] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:10] [INFO ] Invariant cache hit.
[2024-05-21 16:35:10] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 16:35:10] [INFO ] Invariant cache hit.
[2024-05-21 16:35:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:10] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 16:35:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:35:10] [INFO ] Invariant cache hit.
[2024-05-21 16:35:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 407 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=407 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-21 16:35:11] [INFO ] Invariant cache hit.
[2024-05-21 16:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:35:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 16:35:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 16:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 16:35:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 16:35:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:11] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 16:35:11] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 16:35:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 7 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 87 ms.
Built C files in :
/tmp/ltsmin913377922410720387
[2024-05-21 16:35:11] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 16:35:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:35:11] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 16:35:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:35:11] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 16:35:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:35:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin913377922410720387
Running compilation step : cd /tmp/ltsmin913377922410720387;'/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 91 ms.
Running link step : cd /tmp/ltsmin913377922410720387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin913377922410720387;'/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/stateBased3414104240104252864.hoa' '--buchi-type=spotba'
LTSmin run took 50 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-05 finished in 2035 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' '!(((!p0 U p1)&&F(G(!p2))))'
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:11] [INFO ] Invariant cache hit.
[2024-05-21 16:35:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 16:35:11] [INFO ] Invariant cache hit.
[2024-05-21 16:35:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-21 16:35:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:35:11] [INFO ] Invariant cache hit.
[2024-05-21 16:35:12] [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 84 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) p2), true, (NOT p1), p2]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p0:(OR (LT s0 1) (LT s4 1)), p2:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p2]
Finished random walk after 104 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 9 factoid took 145 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 48 ms :[p2]
Stuttering acceptance computed with spot in 27 ms :[p2]
Support contains 1 out of 11 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 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:12] [INFO ] Invariant cache hit.
[2024-05-21 16:35:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 16:35:12] [INFO ] Invariant cache hit.
[2024-05-21 16:35:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:12] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-21 16:35:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:35:12] [INFO ] Invariant cache hit.
[2024-05-21 16:35:12] [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 97 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 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 30 ms :[p2]
Finished random walk after 104 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p2]
Stuttering acceptance computed with spot in 27 ms :[p2]
Stuttering acceptance computed with spot in 38 ms :[p2]
Product exploration explored 100000 steps with 0 reset in 56 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Built C files in :
/tmp/ltsmin4684048715418785548
[2024-05-21 16:35:13] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 16:35:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:35:13] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 16:35:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:35:13] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 16:35:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:35:13] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4684048715418785548
Running compilation step : cd /tmp/ltsmin4684048715418785548;'/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 81 ms.
Running link step : cd /tmp/ltsmin4684048715418785548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4684048715418785548;'/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/stateBased5516033614315535852.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-06 finished in 1699 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 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:13] [INFO ] Invariant cache hit.
[2024-05-21 16:35:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 16:35:13] [INFO ] Invariant cache hit.
[2024-05-21 16:35:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-21 16:35:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 16:35:13] [INFO ] Invariant cache hit.
[2024-05-21 16:35:13] [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 81 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-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:(AND (LT s4 1) (LT s5 1) (LT s6 1) (OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 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 87 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 48 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
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 95 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-21 16:35:14] [INFO ] Invariant cache hit.
[2024-05-21 16:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 16:35:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 16:35:14] [INFO ] Solution in real domain found non-integer solution.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D03N100-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-07 finished in 871 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 U X((!p1 U p2))))))'
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:14] [INFO ] Invariant cache hit.
[2024-05-21 16:35:14] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 16:35:14] [INFO ] Invariant cache hit.
[2024-05-21 16:35:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 16:35:14] [INFO ] Invariant cache hit.
[2024-05-21 16:35:14] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s4 1) (LT s5 1) (LT s6 1)), p2:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p1:(OR (LT s0 1) (LT s4 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 25043 reset in 80 ms.
Product exploration explored 100000 steps with 25076 reset in 74 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Incomplete random walk after 10018 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1252 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 16:35:15] [INFO ] Invariant cache hit.
[2024-05-21 16:35:15] [INFO ] After 16ms 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 p0) p2 (NOT p1)), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F p0), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 343 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:15] [INFO ] Invariant cache hit.
[2024-05-21 16:35:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 16:35:15] [INFO ] Invariant cache hit.
[2024-05-21 16:35:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:15] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 16:35:15] [INFO ] Invariant cache hit.
[2024-05-21 16:35:16] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/11 stabilizing places and 7/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT p0)), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 114 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Finished random walk after 6780 steps, including 2 resets, run visited all 4 properties in 9 ms. (steps per millisecond=753 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT p0)), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p0), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 264 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 24988 reset in 64 ms.
Product exploration explored 100000 steps with 25054 reset in 61 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:35:17] [INFO ] Invariant cache hit.
[2024-05-21 16:35:17] [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 33 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin889864866349443175
[2024-05-21 16:35:17] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin889864866349443175
Running compilation step : cd /tmp/ltsmin889864866349443175;'/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 88 ms.
Running link step : cd /tmp/ltsmin889864866349443175;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin889864866349443175;'/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/stateBased15033304216875374472.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:32] [INFO ] Invariant cache hit.
[2024-05-21 16:35:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 16:35:32] [INFO ] Invariant cache hit.
[2024-05-21 16:35:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 16:35:32] [INFO ] Invariant cache hit.
[2024-05-21 16:35:32] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin16524020208421124463
[2024-05-21 16:35:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16524020208421124463
Running compilation step : cd /tmp/ltsmin16524020208421124463;'/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 79 ms.
Running link step : cd /tmp/ltsmin16524020208421124463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16524020208421124463;'/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/stateBased16771552650208268841.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 16:35:47] [INFO ] Flatten gal took : 2 ms
[2024-05-21 16:35:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 16:35:47] [INFO ] Time to serialize gal into /tmp/LTL17927297619526064191.gal : 1 ms
[2024-05-21 16:35:47] [INFO ] Time to serialize properties into /tmp/LTL1315341637088919308.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/LTL17927297619526064191.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11329137452909071925.hoa' '-atoms' '/tmp/LTL1315341637088919308.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...319
Loading property file /tmp/LTL1315341637088919308.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11329137452909071925.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
853 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,8.5391,114188,1,0,44,599044,54,24,913,634544,64
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-09 finished in 42478 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 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:56] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-21 16:35:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 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 67 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-10 finished in 197 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||X(G(p1)))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:57] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (LT s4 1) (LT s5 1) (LT s6 1)), p0:(OR (LT s0 1) (LT s4 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-12 finished in 270 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||X(p1))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s4 1) (LT s5 1) (LT s6 1)), p1:(OR (LT s0 1) (LT s4 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 21836 reset in 68 ms.
Stack based approach found an accepted trace after 209 steps with 38 reset with depth 9 and stack size 9 in 1 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-13 finished in 229 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((X(F(!p0))&&(p1 U X(p1)))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-21 16:35:57] [INFO ] Invariant cache hit.
[2024-05-21 16:35:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 11/11 places, 12/12 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p1:(GEQ s7 1), p0:(AND (LT s4 1) (LT s5 1) (LT s6 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 53 reset in 56 ms.
Stack based approach found an accepted trace after 15 steps with 1 reset with depth 13 and stack size 13 in 0 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-14 finished in 310 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(G(p0)))))'
Found a Lengthening insensitive property : CryptoMiner-COL-D03N100-LTLFireability-03
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:58] [INFO ] Invariant cache hit.
[2024-05-21 16:35:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 16:35:58] [INFO ] Invariant cache hit.
[2024-05-21 16:35:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-21 16:35:58] [INFO ] Invariant cache hit.
[2024-05-21 16:35:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 82 ms. Remains : 11/11 places, 12/12 transitions.
Running random walk in product with property : CryptoMiner-COL-D03N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 70 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 1) seen :0
Finished Best-First random walk after 400 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=200 )
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 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:35:59] [INFO ] Invariant cache hit.
[2024-05-21 16:35:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 16:35:59] [INFO ] Invariant cache hit.
[2024-05-21 16:35:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:35:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 16:35:59] [INFO ] Invariant cache hit.
[2024-05-21 16:35:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 26 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3443 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3443 )
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 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 52 ms.
Product exploration explored 100000 steps with 0 reset in 69 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:36:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 16:36:00] [INFO ] Invariant cache hit.
[2024-05-21 16:36:00] [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 34 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin18295562474662950891
[2024-05-21 16:36:00] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18295562474662950891
Running compilation step : cd /tmp/ltsmin18295562474662950891;'/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 75 ms.
Running link step : cd /tmp/ltsmin18295562474662950891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18295562474662950891;'/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/stateBased16828715894515282830.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 16:36:15] [INFO ] Invariant cache hit.
[2024-05-21 16:36:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 16:36:15] [INFO ] Invariant cache hit.
[2024-05-21 16:36:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:36:15] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-21 16:36:15] [INFO ] Invariant cache hit.
[2024-05-21 16:36:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 11/11 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin5242816068163303905
[2024-05-21 16:36:15] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5242816068163303905
Running compilation step : cd /tmp/ltsmin5242816068163303905;'/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 81 ms.
Running link step : cd /tmp/ltsmin5242816068163303905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5242816068163303905;'/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/stateBased16344923798264150236.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 16:36:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 16:36:30] [INFO ] Flatten gal took : 2 ms
[2024-05-21 16:36:30] [INFO ] Time to serialize gal into /tmp/LTL17409528578611963888.gal : 2 ms
[2024-05-21 16:36:30] [INFO ] Time to serialize properties into /tmp/LTL4938259894536232436.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/LTL17409528578611963888.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13047173895331260711.hoa' '-atoms' '/tmp/LTL4938259894536232436.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...319
Loading property file /tmp/LTL4938259894536232436.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13047173895331260711.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:36:45] [INFO ] Flatten gal took : 2 ms
[2024-05-21 16:36:45] [INFO ] Flatten gal took : 1 ms
[2024-05-21 16:36:45] [INFO ] Time to serialize gal into /tmp/LTL1356252230060330778.gal : 0 ms
[2024-05-21 16:36:45] [INFO ] Time to serialize properties into /tmp/LTL5560998109285230496.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/LTL1356252230060330778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5560998109285230496.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))"))))))
Formula 0 simplified : XXXF!"(((capacity_0>=1)||(capacity_1>=1))||((capacity_2>=1)||(capacity_3>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/i...180
Computing Next relation with stutter on 8037 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:37:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 16:37:00] [INFO ] Applying decomposition
[2024-05-21 16:37: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/graph13119190771305999763.txt' '-o' '/tmp/graph13119190771305999763.bin' '-w' '/tmp/graph13119190771305999763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13119190771305999763.bin' '-l' '-1' '-v' '-w' '/tmp/graph13119190771305999763.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:37:00] [INFO ] Decomposing Gal with order
[2024-05-21 16:37:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:37:00] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 16:37:00] [INFO ] Flatten gal took : 2 ms
[2024-05-21 16:37:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 16:37:00] [INFO ] Time to serialize gal into /tmp/LTL562491070677297624.gal : 1 ms
[2024-05-21 16:37:00] [INFO ] Time to serialize properties into /tmp/LTL328528782539046752.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/LTL562491070677297624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL328528782539046752.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...252
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i0.u0.capacity_0>=1)||(i0.u0.capacity_1>=1))||((i0.u1.capacity_2>=1)||(i0.u1.capacity_3>=1)))"))))))
Formula 0 simplified : XXXF!"(((i0.u0.capacity_0>=1)||(i0.u0.capacity_1>=1))||((i0.u1.capacity_2>=1)||(i0.u1.capacity_3>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5236035380461590149
[2024-05-21 16:37:15] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5236035380461590149
Running compilation step : cd /tmp/ltsmin5236035380461590149;'/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 79 ms.
Running link step : cd /tmp/ltsmin5236035380461590149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5236035380461590149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-COL-D03N100-LTLFireability-03 finished in 93012 ms.
[2024-05-21 16:37:30] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
[2024-05-21 16:37:30] [INFO ] Applying decomposition
[2024-05-21 16:37:30] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin9131545213926323807
[2024-05-21 16:37:30] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 16:37:30] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:37:30] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 16:37:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:37:31] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 16:37:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:37:31] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9131545213926323807
Running compilation step : cd /tmp/ltsmin9131545213926323807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4384785183685675965.txt' '-o' '/tmp/graph4384785183685675965.bin' '-w' '/tmp/graph4384785183685675965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4384785183685675965.bin' '-l' '-1' '-v' '-w' '/tmp/graph4384785183685675965.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:37:31] [INFO ] Decomposing Gal with order
[2024-05-21 16:37:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:37:31] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 16:37:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:37:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 16:37:31] [INFO ] Time to serialize gal into /tmp/LTLFireability16895840849330486886.gal : 1 ms
[2024-05-21 16:37:31] [INFO ] Time to serialize properties into /tmp/LTLFireability17176795419705583530.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/LTLFireability16895840849330486886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17176795419705583530.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...278
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i0.u0.capacity_0>=1)||(i0.u0.capacity_1>=1))||((i0.u1.capacity_2>=1)||(i0.u1.capacity_3>=1)))"))))))
Formula 0 simplified : XXXF!"(((i0.u0.capacity_0>=1)||(i0.u0.capacity_1>=1))||((i0.u1.capacity_2>=1)||(i0.u1.capacity_3>=1)))"
Compilation finished in 97 ms.
Running link step : cd /tmp/ltsmin9131545213926323807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin9131545213926323807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t9, u2.t8, u3.t10, u3.t11, Intersection with reachable at each step enabled. (destroyed/...189
Computing Next relation with stutter on 8037 deadlock states
LTSmin run took 147816 ms.
FORMULA CryptoMiner-COL-D03N100-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 394557 ms.

BK_STOP 1716309599908

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-COL-D03N100"
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-COL-D03N100, 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-171624208000193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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