Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 34K Apr 12 12:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 197K Apr 12 12:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K Apr 12 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 363K Apr 12 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 219K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.2K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 27K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716323429934

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 20:30:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:30:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:30:31] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-05-21 20:30:31] [INFO ] Transformed 63 places.
[2024-05-21 20:30:31] [INFO ] Transformed 63 transitions.
[2024-05-21 20:30:31] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 20:30:31] [INFO ] Computed 1 invariants in 10 ms
[2024-05-21 20:30:32] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-21 20:30:32] [INFO ] Invariant cache hit.
[2024-05-21 20:30:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-05-21 20:30:32] [INFO ] Invariant cache hit.
[2024-05-21 20:30:32] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 63/63 places, 63/63 transitions.
Support contains 63 out of 63 places after structural reductions.
[2024-05-21 20:30:32] [INFO ] Flatten gal took : 20 ms
[2024-05-21 20:30:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:30:32] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10074 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=132 ) properties (out of 26) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-21 20:30:32] [INFO ] Invariant cache hit.
[2024-05-21 20:30:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:30:32] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-21 20:30:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 31 ms returned sat
[2024-05-21 20:30:33] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :9
[2024-05-21 20:30:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:33] [INFO ] After 153ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :6 sat :9
[2024-05-21 20:30:33] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :9
Attempting to minimize the solution found.
Minimization took 207 ms.
[2024-05-21 20:30:33] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :9
Fused 15 Parikh solutions to 9 different solutions.
Parikh walk visited 1 properties in 378 ms.
Support contains 45 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/63 places, 63/63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2516 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:30:34] [INFO ] Invariant cache hit.
[2024-05-21 20:30:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-21 20:30:34] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:30:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:30:34] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:30:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:34] [INFO ] After 7ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:30:34] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 20:30:34] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 63/63 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 62
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 20 place count 63 transition count 43
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 44 transition count 43
Applied a total of 39 rules in 10 ms. Remains 44 /63 variables (removed 19) and now considering 43/63 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 44/63 places, 43/63 transitions.
Incomplete random walk after 10067 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2516 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Finished probabilistic random walk after 59746 steps, run visited all 2 properties in 171 ms. (steps per millisecond=349 )
Probabilistic random walk after 59746 steps, saw 18166 distinct states, run finished after 171 ms. (steps per millisecond=349 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)&&p0))&&F(p2))))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (complete) has 165 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 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 20:30:35] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 20:30:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 20:30:35] [INFO ] Invariant cache hit.
[2024-05-21 20:30:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:35] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-21 20:30:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:30:35] [INFO ] Invariant cache hit.
[2024-05-21 20:30:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 62/63 places, 63/63 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 378 ms.
Product exploration explored 100000 steps with 0 reset in 385 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
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X p2), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 152 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Finished random walk after 122 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X p2), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p2))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 220 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
[2024-05-21 20:30:37] [INFO ] Invariant cache hit.
[2024-05-21 20:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:30:37] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 20:30:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:30:37] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 20:30:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2024-05-21 20:30:37] [INFO ] Computed and/alt/rep : 60/100/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 20:30:37] [INFO ] Added : 52 causal constraints over 11 iterations in 93 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 20:30:37] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X p2), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p2))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (NOT p2)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 237 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-01 finished in 2777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||G(!p1))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 20:30:37] [INFO ] Computed 1 invariants in 6 ms
[2024-05-21 20:30:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 20:30:37] [INFO ] Invariant cache hit.
[2024-05-21 20:30:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:37] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-21 20:30:37] [INFO ] Invariant cache hit.
[2024-05-21 20:30:37] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, false, false, (NOT p1), p1]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-03 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 42 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:30:38] [INFO ] Invariant cache hit.
[2024-05-21 20:30:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 20:30:38] [INFO ] Invariant cache hit.
[2024-05-21 20:30:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:38] [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 20:30:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:30:38] [INFO ] Invariant cache hit.
[2024-05-21 20:30:38] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 196 ms.
Product exploration explored 100000 steps with 0 reset in 283 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Finished random walk after 3460 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1730 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
[2024-05-21 20:30:39] [INFO ] Invariant cache hit.
Proved EG p0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-04 finished in 1166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 21 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 2 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 20:30:39] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 20:30:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 20:30:39] [INFO ] Invariant cache hit.
[2024-05-21 20:30:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:39] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-21 20:30:39] [INFO ] Invariant cache hit.
[2024-05-21 20:30:39] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 170 ms.
Product exploration explored 100000 steps with 0 reset in 232 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
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3456 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3456 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 20:30:41] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-05 finished in 1710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&(!p0 U p1))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 20:30:41] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 20:30:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 20:30:41] [INFO ] Invariant cache hit.
[2024-05-21 20:30:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:41] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-21 20:30:41] [INFO ] Invariant cache hit.
[2024-05-21 20:30:41] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}]], initial=2, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 407 ms.
Product exploration explored 100000 steps with 0 reset in 456 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 94 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10086 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1120 ) properties (out of 4) seen :3
Finished Best-First random walk after 200 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 190 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:30:43] [INFO ] Invariant cache hit.
[2024-05-21 20:30:43] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 20:30:43] [INFO ] Invariant cache hit.
[2024-05-21 20:30:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:30:43] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-21 20:30:43] [INFO ] Invariant cache hit.
[2024-05-21 20:30:43] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 63/63 places, 63/63 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 94 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10007 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 4) seen :3
Finished Best-First random walk after 200 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 245 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 355 ms.
Product exploration explored 100000 steps with 0 reset in 385 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:30:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:30:45] [INFO ] Invariant cache hit.
[2024-05-21 20:30:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 63/63 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin16618158654944054195
[2024-05-21 20:30:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16618158654944054195
Running compilation step : cd /tmp/ltsmin16618158654944054195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 250 ms.
Running link step : cd /tmp/ltsmin16618158654944054195;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16618158654944054195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11965370509744900238.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:31:00] [INFO ] Invariant cache hit.
[2024-05-21 20:31:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:31:00] [INFO ] Invariant cache hit.
[2024-05-21 20:31:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:31:00] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-21 20:31:00] [INFO ] Invariant cache hit.
[2024-05-21 20:31:00] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 63/63 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin10201753084988556849
[2024-05-21 20:31:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10201753084988556849
Running compilation step : cd /tmp/ltsmin10201753084988556849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin10201753084988556849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10201753084988556849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10434679998234936107.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:31:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:31:16] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:31:16] [INFO ] Time to serialize gal into /tmp/LTL7407897683949427550.gal : 2 ms
[2024-05-21 20:31:16] [INFO ] Time to serialize properties into /tmp/LTL13045395927265514838.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7407897683949427550.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4592493691348024325.hoa' '-atoms' '/tmp/LTL13045395927265514838.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13045395927265514838.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4592493691348024325.hoa
Detected timeout of ITS tools.
[2024-05-21 20:31:31] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:31:31] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:31:31] [INFO ] Time to serialize gal into /tmp/LTL4169711709303830939.gal : 2 ms
[2024-05-21 20:31:31] [INFO ] Time to serialize properties into /tmp/LTL5500292866433194821.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4169711709303830939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5500292866433194821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((("((((((capacity_c0+capacity_c1)+(capacity_c10+capacity_c11))+((capacity_c12+capacity_c13)+(capacity_c14+capacity_c15)))+(((capa...4892
Formula 0 simplified : X((!"((((((capacity_c0+capacity_c1)+(capacity_c10+capacity_c11))+((capacity_c12+capacity_c13)+(capacity_c14+capacity_c15)))+(((capac...2419
Detected timeout of ITS tools.
[2024-05-21 20:31:46] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:31:46] [INFO ] Applying decomposition
[2024-05-21 20:31:46] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph13436943182181414950.txt' '-o' '/tmp/graph13436943182181414950.bin' '-w' '/tmp/graph13436943182181414950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13436943182181414950.bin' '-l' '-1' '-v' '-w' '/tmp/graph13436943182181414950.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:31:46] [INFO ] Decomposing Gal with order
[2024-05-21 20:31:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:31:46] [INFO ] Flatten gal took : 25 ms
[2024-05-21 20:31:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 20:31:46] [INFO ] Time to serialize gal into /tmp/LTL16350855748014696525.gal : 2 ms
[2024-05-21 20:31:46] [INFO ] Time to serialize properties into /tmp/LTL17866805419401675389.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16350855748014696525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17866805419401675389.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((("((((((gu0.capacity_c0+gu0.capacity_c1)+(gu0.capacity_c10+gu0.capacity_c11))+((gu0.capacity_c12+gu0.capacity_c13)+(gu0.capacity...6236
Formula 0 simplified : X((!"((((((gu0.capacity_c0+gu0.capacity_c1)+(gu0.capacity_c10+gu0.capacity_c11))+((gu0.capacity_c12+gu0.capacity_c13)+(gu0.capacity_...3091
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17849381999753992213
[2024-05-21 20:32:01] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17849381999753992213
Running compilation step : cd /tmp/ltsmin17849381999753992213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 142 ms.
Running link step : cd /tmp/ltsmin17849381999753992213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17849381999753992213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||((!(LTLAPp0==true) U (LTLAPp1==true))&&((LTLAPp0==true)||X((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-06 finished in 95194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(F(p1)))))))'
Support contains 63 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:32:16] [INFO ] Invariant cache hit.
[2024-05-21 20:32:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:32:16] [INFO ] Invariant cache hit.
[2024-05-21 20:32:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:32:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-21 20:32:16] [INFO ] Invariant cache hit.
[2024-05-21 20:32:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ (ADD s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 199 ms.
Product exploration explored 100000 steps with 0 reset in 258 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 165 edges and 63 vertex of which 22 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 101 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-21 20:32:18] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-05-21 20:32:18] [INFO ] Invariant cache hit.
[2024-05-21 20:32:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:32:18] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-07 finished in 1794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1) U p2)))'
Support contains 5 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 5 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 20:32:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 20:32:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 20:32:18] [INFO ] Invariant cache hit.
[2024-05-21 20:32:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:32:18] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-21 20:32:18] [INFO ] Invariant cache hit.
[2024-05-21 20:32:18] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LEQ s53 s37) (LEQ 3 s58)), p1:(LEQ 1 s51), p0:(GT 3 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 reset in 102 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
Detected a total of 40/62 stabilizing places and 41/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 747 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-09 finished in 1324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((p1&&F(p2))))))'
Support contains 6 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 4 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:32:19] [INFO ] Invariant cache hit.
[2024-05-21 20:32:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 20:32:19] [INFO ] Invariant cache hit.
[2024-05-21 20:32:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:32:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-21 20:32:19] [INFO ] Invariant cache hit.
[2024-05-21 20:32:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s44 s32), p1:(LEQ s8 s36), p2:(LEQ s12 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1655 reset in 120 ms.
Product exploration explored 100000 steps with 1590 reset in 131 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
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 p2), (X p0), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 13 factoid took 335 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1006 ) properties (out of 7) seen :4
Finished Best-First random walk after 956 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=478 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) p1)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 13 factoid took 658 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 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 20:32:21] [INFO ] Invariant cache hit.
[2024-05-21 20:32:21] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 20:32:21] [INFO ] Invariant cache hit.
[2024-05-21 20:32:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:32:21] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-21 20:32:21] [INFO ] Invariant cache hit.
[2024-05-21 20:32:21] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 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.0 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 p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) p1))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 13 factoid took 321 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10064 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1258 ) properties (out of 7) seen :4
Finished Best-First random walk after 851 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=425 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) p1))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) p1)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 13 factoid took 667 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 1334 reset in 116 ms.
Product exploration explored 100000 steps with 1450 reset in 139 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 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 10 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:32:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:32:24] [INFO ] Invariant cache hit.
[2024-05-21 20:32:24] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 62/62 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin12976260177003494905
[2024-05-21 20:32:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12976260177003494905
Running compilation step : cd /tmp/ltsmin12976260177003494905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin12976260177003494905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12976260177003494905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4954275127720693894.hoa' '--buchi-type=spotba'
LTSmin run took 108 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-13 finished in 5061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((p0||F(p1)))&&X(G(p2))) U X(p1))))'
Support contains 4 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 3 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
[2024-05-21 20:32:24] [INFO ] Invariant cache hit.
[2024-05-21 20:32:24] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 20:32:24] [INFO ] Invariant cache hit.
[2024-05-21 20:32:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:32:24] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-21 20:32:24] [INFO ] Invariant cache hit.
[2024-05-21 20:32:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 62/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 s22), p2:(GT 1 s52), p0:(LEQ s45 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 145 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-14 finished in 415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1))))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 63 cols
[2024-05-21 20:32:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 20:32:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 20:32:25] [INFO ] Invariant cache hit.
[2024-05-21 20:32:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:32:25] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-21 20:32:25] [INFO ] Invariant cache hit.
[2024-05-21 20:32:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 63/63 places, 63/63 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D20N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s21 s13), p1:(GT s35 s59)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D20N100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D20N100-LTLCardinality-15 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&(!p0 U p1))))))'
[2024-05-21 20:32:25] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4086189476617565093
[2024-05-21 20:32:25] [INFO ] Applying decomposition
[2024-05-21 20:32:25] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-05-21 20:32:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:32:25] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-05-21 20:32:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:32:25] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:32:25] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-05-21 20:32:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:32:25] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4086189476617565093
Running compilation step : cd /tmp/ltsmin4086189476617565093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8365571493866044405.txt' '-o' '/tmp/graph8365571493866044405.bin' '-w' '/tmp/graph8365571493866044405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8365571493866044405.bin' '-l' '-1' '-v' '-w' '/tmp/graph8365571493866044405.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:32:25] [INFO ] Decomposing Gal with order
[2024-05-21 20:32:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:32:25] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:32:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 20:32:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality15514514761302385220.gal : 1 ms
[2024-05-21 20:32:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality2276518269346336472.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15514514761302385220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2276518269346336472.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X((("((((((gi0.gu0.capacity_c0+gi0.gu0.capacity_c1)+(gi0.gu0.capacity_c10+gi0.gu0.capacity_c11))+((gi0.gu0.capacity_c12+gi0.gu0.cap...7496
Formula 0 simplified : X((!"((((((gi0.gu0.capacity_c0+gi0.gu0.capacity_c1)+(gi0.gu0.capacity_c10+gi0.gu0.capacity_c11))+((gi0.gu0.capacity_c12+gi0.gu0.capa...3679
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin4086189476617565093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin4086189476617565093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu2.t21, gu2.t22, gu2.t23, gu2.t24, gu2.t25, gu2.t26, gu2.t27, gu2.t28, gu2.t29, gu2.t30, gu2...349
Computing Next relation with stutter on 1.07042e+08 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))
pins2lts-mc-linux64( 1/ 8), 0.001: "X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.036: DFS-FIFO for weak LTL, using special progress label 66
pins2lts-mc-linux64( 0/ 8), 0.036: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.036: State length is 64, there are 71 groups
pins2lts-mc-linux64( 0/ 8), 0.036: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.036: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.036: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.036: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.042: ~1 levels ~960 states ~3232 transitions
pins2lts-mc-linux64( 0/ 8), 0.046: ~1 levels ~1920 states ~7120 transitions
pins2lts-mc-linux64( 0/ 8), 0.071: ~1 levels ~3840 states ~14136 transitions
pins2lts-mc-linux64( 0/ 8), 0.106: ~1 levels ~7680 states ~28872 transitions
pins2lts-mc-linux64( 0/ 8), 0.144: ~1 levels ~15360 states ~60600 transitions
pins2lts-mc-linux64( 0/ 8), 0.241: ~1 levels ~30720 states ~129280 transitions
pins2lts-mc-linux64( 0/ 8), 0.482: ~1 levels ~61440 states ~260912 transitions
pins2lts-mc-linux64( 0/ 8), 0.906: ~1 levels ~122880 states ~531256 transitions
pins2lts-mc-linux64( 5/ 8), 1.600: ~1 levels ~245760 states ~1133096 transitions
pins2lts-mc-linux64( 5/ 8), 2.541: ~1 levels ~491520 states ~2315392 transitions
pins2lts-mc-linux64( 1/ 8), 3.691: ~1 levels ~983040 states ~4427584 transitions
pins2lts-mc-linux64( 1/ 8), 5.500: ~1 levels ~1966080 states ~9179792 transitions
pins2lts-mc-linux64( 1/ 8), 9.262: ~1 levels ~3932160 states ~18822816 transitions
pins2lts-mc-linux64( 1/ 8), 17.109: ~1 levels ~7864320 states ~38811376 transitions
pins2lts-mc-linux64( 1/ 8), 32.697: ~1 levels ~15728640 states ~80031968 transitions
pins2lts-mc-linux64( 1/ 8), 65.070: ~1 levels ~31457280 states ~165929512 transitions
pins2lts-mc-linux64( 1/ 8), 139.727: ~1 levels ~62914560 states ~341628264 transitions
pins2lts-mc-linux64( 3/ 8), 311.657: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 311.690:
pins2lts-mc-linux64( 0/ 8), 311.690: mean standard work distribution: 8.4% (states) 1.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 311.690:
pins2lts-mc-linux64( 0/ 8), 311.690: Explored 107859255 states 689571713 transitions, fanout: 6.393
pins2lts-mc-linux64( 0/ 8), 311.690: Total exploration time 311.650 sec (311.590 sec minimum, 311.606 sec on average)
pins2lts-mc-linux64( 0/ 8), 311.690: States per second: 346091, Transitions per second: 2212648
pins2lts-mc-linux64( 0/ 8), 311.690:
pins2lts-mc-linux64( 0/ 8), 311.690: Progress states detected: 134217283
pins2lts-mc-linux64( 0/ 8), 311.690: Redundant explorations: -19.6384
pins2lts-mc-linux64( 0/ 8), 311.690:
pins2lts-mc-linux64( 0/ 8), 311.690: Queue width: 8B, total height: 50197959, memory: 382.98MB
pins2lts-mc-linux64( 0/ 8), 311.690: Tree memory: 1185.1MB, 9.3 B/state, compr.: 3.6%
pins2lts-mc-linux64( 0/ 8), 311.690: Tree fill ratio (roots/leafs): 99.0%/62.0%
pins2lts-mc-linux64( 0/ 8), 311.690: Stored 63 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 311.690: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 311.690: Est. total memory use: 1568.1MB (~1407.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4086189476617565093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4086189476617565093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)||X((LTLAPp0==true))) U ([](((LTLAPp0==true)||X((LTLAPp0==true))))||(((LTLAPp0==true)||X((LTLAPp0==true)))&&(!(LTLAPp0==true) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 20:53:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:53:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality15786019509351420436.gal : 2 ms
[2024-05-21 20:53:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality3636345021687477840.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15786019509351420436.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3636345021687477840.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X((("((((((capacity_c0+capacity_c1)+(capacity_c10+capacity_c11))+((capacity_c12+capacity_c13)+(capacity_c14+capacity_c15)))+(((capa...4892
Formula 0 simplified : X((!"((((((capacity_c0+capacity_c1)+(capacity_c10+capacity_c11))+((capacity_c12+capacity_c13)+(capacity_c14+capacity_c15)))+(((capac...2419
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39...265
Computing Next relation with stutter on 1.07042e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:13:41] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:13:41] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-21 21:13:41] [INFO ] Transformed 63 places.
[2024-05-21 21:13:41] [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 21:13:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality1493425291139462053.gal : 1 ms
[2024-05-21 21:13:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality7130038181585787665.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1493425291139462053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7130038181585787665.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.202304061127/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((("((((((capacity_c0+capacity_c1)+(capacity_c10+capacity_c11))+((capacity_c12+capacity_c13)+(capacity_c14+capacity_c15)))+(((capa...4892
Formula 0 simplified : X((!"((((((capacity_c0+capacity_c1)+(capacity_c10+capacity_c11))+((capacity_c12+capacity_c13)+(capacity_c14+capacity_c15)))+(((capac...2419
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39...265
Computing Next relation with stutter on 1.07042e+08 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12604420 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038620 kB

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CryptoMiner-PT-D20N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208200267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D20N100.tgz
mv CryptoMiner-PT-D20N100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;