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.r092-tall-171624189100356.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 itstools
Input is CryptoMiner-COL-D20N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189100356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.9K Apr 12 12:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716299979271

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D20N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-21 13:59:40] [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 13:59:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:59:40] [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 13:59:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 13:59:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 474 ms
[2024-05-21 13:59:40] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 63 PT places and 105.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 13:59:41] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2024-05-21 13:59:41] [INFO ] Skeletonized 6 HLPN properties in 3 ms. Removed 10 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) 21)]] contains successor/predecessor on variables of sort CD
[2024-05-21 13:59:41] [INFO ] Unfolded HLPN to a Petri net with 63 places and 63 transitions 187 arcs in 14 ms.
[2024-05-21 13:59:41] [INFO ] Unfolded 16 HLPN properties in 6 ms.
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 10 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 13:59:41] [INFO ] Computed 0 invariants in 9 ms
[2024-05-21 13:59:41] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 13:59:41] [INFO ] Invariant cache hit.
[2024-05-21 13:59:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 13:59:41] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 13:59:41] [INFO ] Invariant cache hit.
[2024-05-21 13:59:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1377 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1709 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3144ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3155ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3433 ms. Remains : 62/63 places, 63/63 transitions.
Support contains 42 out of 62 places after structural reductions.
[2024-05-21 13:59:44] [INFO ] Flatten gal took : 19 ms
[2024-05-21 13:59:44] [INFO ] Flatten gal took : 14 ms
[2024-05-21 13:59:44] [INFO ] Input system was already deterministic with 63 transitions.
Reduction of identical properties reduced properties to check from 12 to 9
RANDOM walk for 40293 steps (8 resets) in 130 ms. (307 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 559 ms. (71 steps per ms) remains 1/1 properties
[2024-05-21 13:59:45] [INFO ] Invariant cache hit.
[2024-05-21 13:59:45] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 20/125 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[State Equation: 0/62 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 41 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 13:59:45] [INFO ] Invariant cache hit.
[2024-05-21 13:59:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 13:59:45] [INFO ] Invariant cache hit.
[2024-05-21 13:59:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 13:59:45] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-21 13:59:45] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 13:59:45] [INFO ] Invariant cache hit.
[2024-05-21 13:59:45] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1179 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1600 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2790ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2790ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2890 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 323 ms.
Product exploration explored 100000 steps with 0 reset in 408 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 138 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 7194 steps (2 resets) in 15 ms. (449 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 276 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 41 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 13:59:50] [INFO ] Invariant cache hit.
[2024-05-21 13:59:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 13:59:50] [INFO ] Invariant cache hit.
[2024-05-21 13:59:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 13:59:50] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-21 13:59:50] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 13:59:50] [INFO ] Invariant cache hit.
[2024-05-21 13:59:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1197 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1635 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2843ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2845ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2943 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 141 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 30433 steps (7 resets) in 43 ms. (691 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 269 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 189 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Built C files in :
/tmp/ltsmin16147418704491862059
[2024-05-21 13:59:54] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 13:59:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:59:54] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 13:59:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:59:54] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 13:59:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:59:54] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16147418704491862059
Running compilation step : cd /tmp/ltsmin16147418704491862059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 271 ms.
Running link step : cd /tmp/ltsmin16147418704491862059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16147418704491862059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5926410687792608660.hoa' '--buchi-type=spotba'
LTSmin run took 110 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-01 finished in 9505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 9 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2024-05-21 13:59:54] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 13:59:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 13:59:55] [INFO ] Invariant cache hit.
[2024-05-21 13:59:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 13:59:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-21 13:59:55] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-21 13:59:55] [INFO ] Invariant cache hit.
[2024-05-21 13:59:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 664 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 733 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1409ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1487 ms. Remains : 42/62 places, 43/63 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-02
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-02 finished in 1587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 42 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 13:59:56] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 13:59:56] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 13:59:56] [INFO ] Invariant cache hit.
[2024-05-21 13:59:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 13:59:56] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 13:59:56] [INFO ] Invariant cache hit.
[2024-05-21 13:59:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1218 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1608 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2837ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2838ms
Finished structural reductions in LTL mode , in 1 iterations and 2930 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-03
Product exploration explored 100000 steps with 723 reset in 164 ms.
Product exploration explored 100000 steps with 710 reset in 172 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 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 (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3878 steps (0 resets) in 9 ms. (387 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 192 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 14:00:00] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 10 factoid took 187 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-03 finished in 4336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:00:00] [INFO ] Invariant cache hit.
[2024-05-21 14:00:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 14:00:00] [INFO ] Invariant cache hit.
[2024-05-21 14:00:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:00:00] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:00:00] [INFO ] Invariant cache hit.
[2024-05-21 14:00:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1190 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1642 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2842ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2843ms
Finished structural reductions in LTL mode , in 1 iterations and 2937 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, p0, p0]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-04 finished in 3047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(!p1)||p0))))'
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:00:03] [INFO ] Invariant cache hit.
[2024-05-21 14:00:03] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 14:00:03] [INFO ] Invariant cache hit.
[2024-05-21 14:00:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:00:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:00:04] [INFO ] Invariant cache hit.
[2024-05-21 14:00:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1188 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1640 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2837ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2837ms
Finished structural reductions in LTL mode , in 1 iterations and 2922 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 329 ms.
Product exploration explored 100000 steps with 0 reset in 354 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 178 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40320 steps (10 resets) in 50 ms. (790 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 579 ms. (68 steps per ms) remains 1/1 properties
[2024-05-21 14:00:08] [INFO ] Invariant cache hit.
[2024-05-21 14:00:08] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 20/125 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[State Equation: 0/62 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 593 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:00:09] [INFO ] Invariant cache hit.
[2024-05-21 14:00:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 14:00:09] [INFO ] Invariant cache hit.
[2024-05-21 14:00:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:00:09] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:00:09] [INFO ] Invariant cache hit.
[2024-05-21 14:00:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1206 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1662 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2880ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2881ms
Finished structural reductions in LTL mode , in 1 iterations and 2959 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 2100 steps (0 resets) in 6 ms. (300 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 190 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 112 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 100 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 229 ms.
Product exploration explored 100000 steps with 0 reset in 247 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 103 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 8 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
[2024-05-21 14:00:13] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 43 rows 42 cols
[2024-05-21 14:00:13] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 14:00:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 650 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 739 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1400ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1400ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1416 ms. Remains : 42/62 places, 43/63 transitions.
Built C files in :
/tmp/ltsmin8098286400578278497
[2024-05-21 14:00:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8098286400578278497
Running compilation step : cd /tmp/ltsmin8098286400578278497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin8098286400578278497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8098286400578278497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1705478716997433039.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 14:00:30] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 14:00:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 14:00:30] [INFO ] Invariant cache hit.
[2024-05-21 14:00:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:00:30] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:00:30] [INFO ] Invariant cache hit.
[2024-05-21 14:00:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1241 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1696 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2944ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2945ms
Finished structural reductions in LTL mode , in 1 iterations and 3034 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin11452335179080246049
[2024-05-21 14:00:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11452335179080246049
Running compilation step : cd /tmp/ltsmin11452335179080246049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 167 ms.
Running link step : cd /tmp/ltsmin11452335179080246049;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11452335179080246049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10475459587733848412.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 14:00:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:00:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:00:48] [INFO ] Time to serialize gal into /tmp/LTL12482918591915790473.gal : 2 ms
[2024-05-21 14:00:48] [INFO ] Time to serialize properties into /tmp/LTL8730786538852441911.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12482918591915790473.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14323397280087110381.hoa' '-atoms' '/tmp/LTL8730786538852441911.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8730786538852441911.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14323397280087110381.hoa
Detected timeout of ITS tools.
[2024-05-21 14:01:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:01:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:01:03] [INFO ] Time to serialize gal into /tmp/LTL12314637531348055039.gal : 1 ms
[2024-05-21 14:01:03] [INFO ] Time to serialize properties into /tmp/LTL16982295838899607017.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12314637531348055039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16982295838899607017.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((state_11>=1)||(state_12>=1))||((state_13>=1)||(state_14>=1)))||(((state_15>=1)||(state_16>=1))||((state_18>=1)||(state_1...681
Formula 0 simplified : XF(!"(((((state_11>=1)||(state_12>=1))||((state_13>=1)||(state_14>=1)))||(((state_15>=1)||(state_16>=1))||((state_18>=1)||(state_17>...671
Detected timeout of ITS tools.
[2024-05-21 14:01:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:01:18] [INFO ] Applying decomposition
[2024-05-21 14:01:18] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17224245729210543276.txt' '-o' '/tmp/graph17224245729210543276.bin' '-w' '/tmp/graph17224245729210543276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17224245729210543276.bin' '-l' '-1' '-v' '-w' '/tmp/graph17224245729210543276.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:01:18] [INFO ] Decomposing Gal with order
[2024-05-21 14:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:01:18] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-21 14:01:18] [INFO ] Flatten gal took : 17 ms
[2024-05-21 14:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 14:01:18] [INFO ] Time to serialize gal into /tmp/LTL13422517101755636035.gal : 2 ms
[2024-05-21 14:01:18] [INFO ] Time to serialize properties into /tmp/LTL1194386973292986191.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13422517101755636035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1194386973292986191.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((i5.u13.state_11>=1)||(i5.u13.state_12>=1))||((i6.u14.state_13>=1)||(i6.u14.state_14>=1)))||(((i6.u15.state_15>=1)||(i6.u...957
Formula 0 simplified : XF(!"(((((i5.u13.state_11>=1)||(i5.u13.state_12>=1))||((i6.u14.state_13>=1)||(i6.u14.state_14>=1)))||(((i6.u15.state_15>=1)||(i6.u15...947
Detected timeout of ITS tools.
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-05 finished in 89633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 22 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:01:33] [INFO ] Invariant cache hit.
[2024-05-21 14:01:33] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 14:01:33] [INFO ] Invariant cache hit.
[2024-05-21 14:01:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:33] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-21 14:01:33] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 14:01:33] [INFO ] Invariant cache hit.
[2024-05-21 14:01:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1202 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1648 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2859ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2859ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2958 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND (NOT p2) p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-07
Product exploration explored 100000 steps with 1234 reset in 117 ms.
Product exploration explored 100000 steps with 1260 reset in 122 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 510 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 2100 steps (0 resets) in 5 ms. (350 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 687 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
[2024-05-21 14:01:38] [INFO ] Invariant cache hit.
[2024-05-21 14:01:38] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-21 14:01:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:38] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 14:01:38] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 14:01:38] [INFO ] Added : 18 causal constraints over 4 iterations in 28 ms. Result :sat
Could not prove EG p0
[2024-05-21 14:01:38] [INFO ] Invariant cache hit.
[2024-05-21 14:01:38] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-21 14:01:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:38] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 14:01:38] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 14:01:38] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 22 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:01:38] [INFO ] Invariant cache hit.
[2024-05-21 14:01:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 14:01:38] [INFO ] Invariant cache hit.
[2024-05-21 14:01:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:38] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-21 14:01:38] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 14:01:38] [INFO ] Invariant cache hit.
[2024-05-21 14:01:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1213 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1624 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2845ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2846ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2936 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.13 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 498 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 8362 steps (0 resets) in 16 ms. (491 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 668 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 136 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
[2024-05-21 14:01:43] [INFO ] Invariant cache hit.
[2024-05-21 14:01:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-21 14:01:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:43] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 14:01:43] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 14:01:43] [INFO ] Added : 18 causal constraints over 4 iterations in 25 ms. Result :sat
Could not prove EG p0
[2024-05-21 14:01:43] [INFO ] Invariant cache hit.
[2024-05-21 14:01:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-21 14:01:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:43] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 14:01:43] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 14:01:43] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 121 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1212 reset in 119 ms.
Product exploration explored 100000 steps with 1263 reset in 115 ms.
Built C files in :
/tmp/ltsmin7401768640670162047
[2024-05-21 14:01:43] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 14:01:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:01:43] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 14:01:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:01:43] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 14:01:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:01:43] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7401768640670162047
Running compilation step : cd /tmp/ltsmin7401768640670162047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin7401768640670162047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7401768640670162047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12715439668075522802.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-07 finished in 10475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 3 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2024-05-21 14:01:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 14:01:44] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 14:01:44] [INFO ] Invariant cache hit.
[2024-05-21 14:01:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:44] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-21 14:01:44] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-21 14:01:44] [INFO ] Invariant cache hit.
[2024-05-21 14:01:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 649 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 721 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1383ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1384ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1462 ms. Remains : 42/62 places, 43/63 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-08
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-08 finished in 1601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F((p0&&X(X(p1)))))))'
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 14:01:45] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 14:01:45] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 14:01:45] [INFO ] Invariant cache hit.
[2024-05-21 14:01:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:01:45] [INFO ] Invariant cache hit.
[2024-05-21 14:01:45] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1218 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1627 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2851ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2853ms
Finished structural reductions in LTL mode , in 1 iterations and 2929 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-09 finished in 3174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 4 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2024-05-21 14:01:48] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 14:01:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 14:01:48] [INFO ] Invariant cache hit.
[2024-05-21 14:01:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:48] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-21 14:01:48] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-21 14:01:48] [INFO ] Invariant cache hit.
[2024-05-21 14:01:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 648 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 752 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1412ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1503 ms. Remains : 42/62 places, 43/63 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-10
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-10 finished in 1546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 40 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 4 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 12 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
[2024-05-21 14:01:50] [INFO ] Invariant cache hit.
[2024-05-21 14:01:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 14:01:50] [INFO ] Invariant cache hit.
[2024-05-21 14:01:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:50] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-21 14:01:50] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-21 14:01:50] [INFO ] Invariant cache hit.
[2024-05-21 14:01:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 657 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 681 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1347ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1430 ms. Remains : 42/62 places, 43/63 transitions.
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-11
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-11 finished in 1530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-21 14:01:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 14:01:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 14:01:51] [INFO ] Invariant cache hit.
[2024-05-21 14:01:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:51] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:01:51] [INFO ] Invariant cache hit.
[2024-05-21 14:01:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1193 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1601 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2801ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2801ms
Finished structural reductions in LTL mode , in 1 iterations and 2889 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 126 ms.
Product exploration explored 100000 steps with 4 reset in 171 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 304 steps (0 resets) in 4 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:01:56] [INFO ] Invariant cache hit.
[2024-05-21 14:01:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 14:01:56] [INFO ] Invariant cache hit.
[2024-05-21 14:01:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:01:56] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:01:56] [INFO ] Invariant cache hit.
[2024-05-21 14:01:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1232 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1650 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2894ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2894ms
Finished structural reductions in LTL mode , in 1 iterations and 2969 ms. Remains : 62/62 places, 63/63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 304 steps (0 resets) in 4 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 128 ms.
Product exploration explored 100000 steps with 1 reset in 157 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:02:00] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 14:02:00] [INFO ] Invariant cache hit.
[2024-05-21 14:02:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1220 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1622 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2855ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2856ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2871 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin6552471710118774659
[2024-05-21 14:02:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6552471710118774659
Running compilation step : cd /tmp/ltsmin6552471710118774659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin6552471710118774659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6552471710118774659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9465585351079479436.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:02:18] [INFO ] Invariant cache hit.
[2024-05-21 14:02:18] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 14:02:18] [INFO ] Invariant cache hit.
[2024-05-21 14:02:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:02:18] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:02:18] [INFO ] Invariant cache hit.
[2024-05-21 14:02:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1232 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1610 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2853ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2854ms
Finished structural reductions in LTL mode , in 1 iterations and 2953 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin16009653855998996450
[2024-05-21 14:02:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16009653855998996450
Running compilation step : cd /tmp/ltsmin16009653855998996450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 156 ms.
Running link step : cd /tmp/ltsmin16009653855998996450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16009653855998996450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6551614055425149445.hoa' '--buchi-type=spotba'
LTSmin run took 4185 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-12 finished in 33877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||(X(F(p2))&&p1))))'
Support contains 22 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:02:25] [INFO ] Invariant cache hit.
[2024-05-21 14:02:25] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 14:02:25] [INFO ] Invariant cache hit.
[2024-05-21 14:02:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:02:25] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:02:25] [INFO ] Invariant cache hit.
[2024-05-21 14:02:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1214 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1564 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2787ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2788ms
Finished structural reductions in LTL mode , in 1 iterations and 2863 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 58 ms.
Product exploration explored 100000 steps with 33333 reset in 62 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-COL-D20N100-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-13 finished in 3215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)&&F(G(!p1))))))'
Support contains 22 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:02:29] [INFO ] Invariant cache hit.
[2024-05-21 14:02:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 14:02:29] [INFO ] Invariant cache hit.
[2024-05-21 14:02:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:02:29] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:02:29] [INFO ] Invariant cache hit.
[2024-05-21 14:02:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1207 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1655 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2868ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2869ms
Finished structural reductions in LTL mode , in 1 iterations and 2947 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR p0 p1), (OR p0 p1), (OR p0 p1), true, p1]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 134 ms.
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-14 finished in 3281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(p0)||X(p1)))))'
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 14:02:32] [INFO ] Invariant cache hit.
[2024-05-21 14:02:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 14:02:32] [INFO ] Invariant cache hit.
[2024-05-21 14:02:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:02:32] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-21 14:02:32] [INFO ] Invariant cache hit.
[2024-05-21 14:02:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1229 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 63/123 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1602 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2837ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2837ms
Finished structural reductions in LTL mode , in 1 iterations and 2920 ms. Remains : 62/62 places, 63/63 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-15
Entered a terminal (fully accepting) state of product in 155 steps with 3 reset in 1 ms.
FORMULA CryptoMiner-COL-D20N100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-15 finished in 3305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(!p1)||p0))))'
Found a Lengthening insensitive property : CryptoMiner-COL-D20N100-LTLFireability-05
Stuttering acceptance computed with spot in 136 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 62 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 3 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2024-05-21 14:02:35] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 14:02:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 14:02:35] [INFO ] Invariant cache hit.
[2024-05-21 14:02:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:02:35] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-21 14:02:35] [INFO ] Invariant cache hit.
[2024-05-21 14:02:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 658 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 793 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1463ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1464ms
Starting structural reductions in LI_LTL mode, iteration 1 : 42/62 places, 43/63 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1532 ms. Remains : 42/62 places, 43/63 transitions.
Running random walk in product with property : CryptoMiner-COL-D20N100-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 262 ms.
Product exploration explored 100000 steps with 0 reset in 269 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Graph (complete) has 142 edges and 42 vertex of which 1 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 42 stabilizing places and 42 stable transitions
Detected a total of 42/42 stabilizing places and 42/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 166 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40163 steps (548 resets) in 29 ms. (1338 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (1319 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
[2024-05-21 14:02:38] [INFO ] Invariant cache hit.
[2024-05-21 14:02:38] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 20/85 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[State Equation: 0/42 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 18ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 349 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 141 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-21 14:02:38] [INFO ] Invariant cache hit.
[2024-05-21 14:02:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 14:02:38] [INFO ] Invariant cache hit.
[2024-05-21 14:02:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:02:38] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-21 14:02:38] [INFO ] Invariant cache hit.
[2024-05-21 14:02:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 613 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 764 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1387ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1388ms
Finished structural reductions in LTL mode , in 1 iterations and 1459 ms. Remains : 42/42 places, 43/43 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Graph (complete) has 142 edges and 42 vertex of which 1 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 42 stabilizing places and 42 stable transitions
Detected a total of 42/42 stabilizing places and 42/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 383 steps (0 resets) in 5 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 119 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 20 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 43/43 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-21 14:02:41] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-21 14:02:41] [INFO ] Invariant cache hit.
[2024-05-21 14:02:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 646 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 763 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1430ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1431ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1454 ms. Remains : 42/42 places, 43/43 transitions.
Built C files in :
/tmp/ltsmin680358611745008839
[2024-05-21 14:02:43] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin680358611745008839
Running compilation step : cd /tmp/ltsmin680358611745008839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin680358611745008839;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin680358611745008839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5442816688777278616.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-21 14:02:58] [INFO ] Invariant cache hit.
[2024-05-21 14:02:58] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 14:02:58] [INFO ] Invariant cache hit.
[2024-05-21 14:02:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 14:02:58] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-21 14:02:58] [INFO ] Invariant cache hit.
[2024-05-21 14:02:58] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 623 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 737 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1370ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1372ms
Finished structural reductions in LTL mode , in 1 iterations and 1456 ms. Remains : 42/42 places, 43/43 transitions.
Built C files in :
/tmp/ltsmin15331458211893693486
[2024-05-21 14:02:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15331458211893693486
Running compilation step : cd /tmp/ltsmin15331458211893693486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 119 ms.
Running link step : cd /tmp/ltsmin15331458211893693486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15331458211893693486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased242614574114590007.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 14:03:14] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:03:14] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:03:14] [INFO ] Time to serialize gal into /tmp/LTL2752944071643223535.gal : 1 ms
[2024-05-21 14:03:14] [INFO ] Time to serialize properties into /tmp/LTL77424064461098291.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2752944071643223535.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15812025798384213763.hoa' '-atoms' '/tmp/LTL77424064461098291.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL77424064461098291.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15812025798384213763.hoa
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59...270
Computing Next relation with stutter on 1.07042e+08 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
647 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,6.48213,138996,1,0,351,537596,110,301,1724,725269,727
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property CryptoMiner-COL-D20N100-LTLFireability-05 finished in 46417 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2024-05-21 14:03:21] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16755511579000282381
[2024-05-21 14:03:21] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 14:03:21] [INFO ] Applying decomposition
[2024-05-21 14:03:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:03:21] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 14:03:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:03:22] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:03:22] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 14:03:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:03:22] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16755511579000282381
Running compilation step : cd /tmp/ltsmin16755511579000282381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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.202405141337/bin/convert-linux64' '-i' '/tmp/graph13441722442580091153.txt' '-o' '/tmp/graph13441722442580091153.bin' '-w' '/tmp/graph13441722442580091153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13441722442580091153.bin' '-l' '-1' '-v' '-w' '/tmp/graph13441722442580091153.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:03:22] [INFO ] Decomposing Gal with order
[2024-05-21 14:03:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:03:22] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-21 14:03:22] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:03:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 14:03:22] [INFO ] Time to serialize gal into /tmp/LTLFireability7749455412572490803.gal : 1 ms
[2024-05-21 14:03:22] [INFO ] Time to serialize properties into /tmp/LTLFireability1499441398879130543.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7749455412572490803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1499441398879130543.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((i5.i1.u15.state_11>=1)||(i5.i1.u15.state_12>=1))||((i5.i1.u16.state_13>=1)||(i5.i1.u16.state_14>=1)))||(((i6.u17.state_1...1038
Formula 0 simplified : XF(!"(((((i5.i1.u15.state_11>=1)||(i5.i1.u15.state_12>=1))||((i5.i1.u16.state_13>=1)||(i5.i1.u16.state_14>=1)))||(((i6.u17.state_15>...1024
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin16755511579000282381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16755511579000282381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.002: "X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: buchi has 4 states
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.061: DFS-FIFO for weak LTL, using special progress label 66
pins2lts-mc-linux64( 0/ 8), 0.061: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.061: State length is 63, there are 70 groups
pins2lts-mc-linux64( 0/ 8), 0.061: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.061: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.061: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.061: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.072: ~1 levels ~960 states ~3232 transitions
pins2lts-mc-linux64( 2/ 8), 0.080: ~1 levels ~1920 states ~7192 transitions
pins2lts-mc-linux64( 2/ 8), 0.104: ~1 levels ~3840 states ~14112 transitions
pins2lts-mc-linux64( 2/ 8), 0.143: ~1 levels ~7680 states ~28112 transitions
pins2lts-mc-linux64( 2/ 8), 0.199: ~1 levels ~15360 states ~57136 transitions
pins2lts-mc-linux64( 2/ 8), 0.342: ~1 levels ~30720 states ~116248 transitions
pins2lts-mc-linux64( 2/ 8), 0.548: ~1 levels ~61440 states ~236320 transitions
pins2lts-mc-linux64( 2/ 8), 0.937: ~1 levels ~122880 states ~467520 transitions
pins2lts-mc-linux64( 2/ 8), 1.540: ~1 levels ~245760 states ~975944 transitions
pins2lts-mc-linux64( 2/ 8), 2.259: ~1 levels ~491520 states ~1992960 transitions
pins2lts-mc-linux64( 2/ 8), 3.285: ~1 levels ~983040 states ~4152472 transitions
pins2lts-mc-linux64( 2/ 8), 5.174: ~1 levels ~1966080 states ~8978568 transitions
pins2lts-mc-linux64( 2/ 8), 8.665: ~1 levels ~3932160 states ~18326144 transitions
pins2lts-mc-linux64( 2/ 8), 15.899: ~1 levels ~7864320 states ~37849224 transitions
pins2lts-mc-linux64( 2/ 8), 31.245: ~1 levels ~15728640 states ~80943288 transitions
pins2lts-mc-linux64( 2/ 8), 61.320: ~1 levels ~31457280 states ~163044384 transitions
pins2lts-mc-linux64( 0/ 8), 121.391: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 121.426:
pins2lts-mc-linux64( 0/ 8), 121.426: mean standard work distribution: 8.9% (states) 1.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 121.426:
pins2lts-mc-linux64( 0/ 8), 121.426: Explored 50160330 states 315682330 transitions, fanout: 6.293
pins2lts-mc-linux64( 0/ 8), 121.426: Total exploration time 121.370 sec (121.310 sec minimum, 121.331 sec on average)
pins2lts-mc-linux64( 0/ 8), 121.426: States per second: 413284, Transitions per second: 2600992
pins2lts-mc-linux64( 0/ 8), 121.426:
pins2lts-mc-linux64( 0/ 8), 121.426: Progress states detected: 62380171
pins2lts-mc-linux64( 0/ 8), 121.426: Redundant explorations: -19.5893
pins2lts-mc-linux64( 0/ 8), 121.426:
pins2lts-mc-linux64( 0/ 8), 121.426: Queue width: 8B, total height: 22623675, memory: 172.60MB
pins2lts-mc-linux64( 0/ 8), 121.426: Tree memory: 731.9MB, 12.3 B/state, compr.: 4.8%
pins2lts-mc-linux64( 0/ 8), 121.426: Tree fill ratio (roots/leafs): 46.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 121.426: Stored 63 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 121.426: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 121.426: Est. total memory use: 904.5MB (~1196.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16755511579000282381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16755511579000282381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X(!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 14:24:35] [INFO ] Applying decomposition
[2024-05-21 14:24:35] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:24:35] [INFO ] Decomposing Gal with order
[2024-05-21 14:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:24:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:24:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 14:24:35] [INFO ] Time to serialize gal into /tmp/LTLFireability9312819721845815477.gal : 1 ms
[2024-05-21 14:24:35] [INFO ] Time to serialize properties into /tmp/LTLFireability18407372671217782257.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9312819721845815477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18407372671217782257.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((CD11.state_11>=1)||(CD12.state_12>=1))||((CD13.state_13>=1)||(CD14.state_14>=1)))||(((CD15.state_15>=1)||(CD16.state_16>...884
Formula 0 simplified : XF(!"(((((CD11.state_11>=1)||(CD12.state_12>=1))||((CD13.state_13>=1)||(CD14.state_14>=1)))||(((CD15.state_15>=1)||(CD16.state_16>=1...870
Detected timeout of ITS tools.
[2024-05-21 14:45:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:45:48] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-21 14:45:48] [INFO ] Transformed 62 places.
[2024-05-21 14:45:48] [INFO ] Transformed 63 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 14:45:48] [INFO ] Time to serialize gal into /tmp/LTLFireability1938793867760834413.gal : 1 ms
[2024-05-21 14:45:48] [INFO ] Time to serialize properties into /tmp/LTLFireability2345047164309454460.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1938793867760834413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2345047164309454460.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("(((((state_11>=1)||(state_12>=1))||((state_13>=1)||(state_14>=1)))||(((state_15>=1)||(state_16>=1))||((state_18>=1)||(state_1...704
Formula 0 simplified : XF(!"(((((state_11>=1)||(state_12>=1))||((state_13>=1)||(state_14>=1)))||(((state_15>=1)||(state_16>=1))||((state_18>=1)||(state_17>...690
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59...270
Computing Next relation with stutter on 1.07042e+08 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-D20N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CryptoMiner-COL-D20N100, 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 r092-tall-171624189100356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-COL-D20N100.tgz
mv CryptoMiner-COL-D20N100 execution
cd execution
if [ "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 ;