Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680885554910

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D10N100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 16:39:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 16:39:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 16:39:16] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-04-07 16:39:16] [INFO ] Transformed 33 places.
[2023-04-07 16:39:16] [INFO ] Transformed 33 transitions.
[2023-04-07 16:39:16] [INFO ] Parsed PT model containing 33 places and 33 transitions and 97 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D10N100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 15 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 16:39:16] [INFO ] Computed 0 invariants in 8 ms
[2023-04-07 16:39:16] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-04-07 16:39:16] [INFO ] Invariant cache hit.
[2023-04-07 16:39:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-04-07 16:39:16] [INFO ] Invariant cache hit.
[2023-04-07 16:39:16] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 33/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 32/33 places, 33/33 transitions.
Support contains 22 out of 32 places after structural reductions.
[2023-04-07 16:39:17] [INFO ] Flatten gal took : 16 ms
[2023-04-07 16:39:17] [INFO ] Flatten gal took : 6 ms
[2023-04-07 16:39:17] [INFO ] Input system was already deterministic with 33 transitions.
Finished random walk after 3446 steps, including 1 resets, run visited all 15 properties in 12 ms. (steps per millisecond=287 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CryptoMiner-PT-D10N100-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 6 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:39:17] [INFO ] Invariant cache hit.
[2023-04-07 16:39:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 16:39:17] [INFO ] Invariant cache hit.
[2023-04-07 16:39:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:17] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 16:39:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 16:39:17] [INFO ] Invariant cache hit.
[2023-04-07 16:39:17] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 32/32 places, 33/33 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 180 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 302 ms.
Product exploration explored 100000 steps with 0 reset in 312 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 268 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-04-07 16:39:19] [INFO ] Invariant cache hit.
[2023-04-07 16:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:39:19] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-04-07 16:39:19] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:39:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-04-07 16:39:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:39:19] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-07 16:39:19] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:39:19] [INFO ] Invariant cache hit.
[2023-04-07 16:39:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 16:39:19] [INFO ] Invariant cache hit.
[2023-04-07 16:39:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-04-07 16:39:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 16:39:19] [INFO ] Invariant cache hit.
[2023-04-07 16:39:19] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-04-07 16:39:19] [INFO ] Invariant cache hit.
[2023-04-07 16:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:39:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-07 16:39:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:39:20] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-04-07 16:39:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-04-07 16:39:20] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-07 16:39:20] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 157 ms.
Built C files in :
/tmp/ltsmin108249170656650588
[2023-04-07 16:39:20] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:39:20] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:20] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:39:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:20] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:39:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin108249170656650588
Running compilation step : cd /tmp/ltsmin108249170656650588;'/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 244 ms.
Running link step : cd /tmp/ltsmin108249170656650588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin108249170656650588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4340131728813527895.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 8 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:39:35] [INFO ] Invariant cache hit.
[2023-04-07 16:39:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-07 16:39:35] [INFO ] Invariant cache hit.
[2023-04-07 16:39:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:35] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 16:39:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:39:35] [INFO ] Invariant cache hit.
[2023-04-07 16:39:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 32/32 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin8653389984812901745
[2023-04-07 16:39:35] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:39:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:35] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:39:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:35] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:39:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8653389984812901745
Running compilation step : cd /tmp/ltsmin8653389984812901745;'/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 105 ms.
Running link step : cd /tmp/ltsmin8653389984812901745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8653389984812901745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17670744524363156599.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-00 finished in 18424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 11 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 4 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 9 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-04-07 16:39:35] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:39:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 16:39:35] [INFO ] Invariant cache hit.
[2023-04-07 16:39:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:35] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 16:39:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:39:36] [INFO ] Invariant cache hit.
[2023-04-07 16:39:36] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s21 1) (GEQ s11 1) (GEQ s12 1) (GEQ s14 1) (GEQ s15 1) (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-01 finished in 195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p1)))||X(G((F(G(p0))&&p2)))))'
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 16:39:36] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 16:39:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 16:39:36] [INFO ] Invariant cache hit.
[2023-04-07 16:39:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 16:39:36] [INFO ] Invariant cache hit.
[2023-04-07 16:39:36] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p2:(AND (GEQ s0 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-02 finished in 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(!p0)&&(G(p0)||X(X(p1)))))))'
Support contains 21 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:39:36] [INFO ] Invariant cache hit.
[2023-04-07 16:39:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 16:39:36] [INFO ] Invariant cache hit.
[2023-04-07 16:39:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:36] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 16:39:36] [INFO ] Invariant cache hit.
[2023-04-07 16:39:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 327 ms :[p0, (NOT p1), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=7, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p1:(OR (GEQ s31 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 135 ms.
Stack based approach found an accepted trace after 2969 steps with 0 reset with depth 2970 and stack size 2970 in 7 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-03 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p0)))))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:37] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:37] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Product exploration explored 100000 steps with 33333 reset in 94 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CryptoMiner-PT-D10N100-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-05 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 20 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 4 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 22 cols
[2023-04-07 16:39:37] [INFO ] Computed 0 invariants in 3 ms
[2023-04-07 16:39:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:37] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-07 16:39:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:37] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-07 finished in 179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U F(((!G(X(p1))&&X(p0)) U p1))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Graph (trivial) has 19 edges and 32 vertex of which 11 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 5 ms. Remains 22 /32 variables (removed 10) and now considering 23/33 (removed 10) transitions.
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 16:39:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 23/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 22/32 places, 23/33 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-09 finished in 173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(!p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 16:39:37] [INFO ] Computed 0 invariants in 2 ms
[2023-04-07 16:39:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:37] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 16:39:37] [INFO ] Invariant cache hit.
[2023-04-07 16:39:38] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND p1 p0), p1, (AND p1 p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s23 1), p0:(OR (LT s0 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-10 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1)&&(!p0||G(p2)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:39:38] [INFO ] Invariant cache hit.
[2023-04-07 16:39:38] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 16:39:38] [INFO ] Invariant cache hit.
[2023-04-07 16:39:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 16:39:38] [INFO ] Invariant cache hit.
[2023-04-07 16:39:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), (NOT p1), true, (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(GEQ s0 1), p1:(GEQ s24 1), p2:(LT s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-11 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:39:38] [INFO ] Invariant cache hit.
[2023-04-07 16:39:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 16:39:38] [INFO ] Invariant cache hit.
[2023-04-07 16:39:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:38] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 16:39:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 16:39:38] [INFO ] Invariant cache hit.
[2023-04-07 16:39:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s23 1), p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 0 reset in 112 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 818 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=272 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:39:39] [INFO ] Invariant cache hit.
[2023-04-07 16:39:39] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 16:39:39] [INFO ] Invariant cache hit.
[2023-04-07 16:39:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:39] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 16:39:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 16:39:39] [INFO ] Invariant cache hit.
[2023-04-07 16:39:39] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 818 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=204 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 85 ms.
Product exploration explored 100000 steps with 3 reset in 104 ms.
Built C files in :
/tmp/ltsmin3840076359149856156
[2023-04-07 16:39:40] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:39:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:40] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:39:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:40] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:39:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3840076359149856156
Running compilation step : cd /tmp/ltsmin3840076359149856156;'/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 113 ms.
Running link step : cd /tmp/ltsmin3840076359149856156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin3840076359149856156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7283025920356678710.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 7 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:39:55] [INFO ] Invariant cache hit.
[2023-04-07 16:39:55] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-07 16:39:55] [INFO ] Invariant cache hit.
[2023-04-07 16:39:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:39:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-04-07 16:39:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 16:39:55] [INFO ] Invariant cache hit.
[2023-04-07 16:39:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 32/32 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin17905555375338126259
[2023-04-07 16:39:55] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:39:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:55] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:39:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:55] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:39:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:39:55] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17905555375338126259
Running compilation step : cd /tmp/ltsmin17905555375338126259;'/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 114 ms.
Running link step : cd /tmp/ltsmin17905555375338126259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17905555375338126259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5595214243821734400.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 16:40:10] [INFO ] Flatten gal took : 5 ms
[2023-04-07 16:40:10] [INFO ] Flatten gal took : 15 ms
[2023-04-07 16:40:10] [INFO ] Time to serialize gal into /tmp/LTL6537640214603842708.gal : 1 ms
[2023-04-07 16:40:10] [INFO ] Time to serialize properties into /tmp/LTL359348726536696461.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/LTL6537640214603842708.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2172219419424116336.hoa' '-atoms' '/tmp/LTL359348726536696461.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...316
Loading property file /tmp/LTL359348726536696461.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2172219419424116336.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, Intersection with reachable at ea...219
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2023-04-07 16:40:25] [INFO ] Flatten gal took : 6 ms
[2023-04-07 16:40:25] [INFO ] Flatten gal took : 2 ms
[2023-04-07 16:40:25] [INFO ] Time to serialize gal into /tmp/LTL12599550165825214185.gal : 0 ms
[2023-04-07 16:40:25] [INFO ] Time to serialize properties into /tmp/LTL5299765003228307565.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/LTL12599550165825214185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5299765003228307565.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(capacity_c7>=1)")||(G("(state_c10<1)"))))))
Formula 0 simplified : G(F!"(state_c10<1)" & FG!"(capacity_c7>=1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, Intersection with reachable at ea...219
Computing Next relation with stutter on 1.07187e+07 deadlock states
Detected timeout of ITS tools.
[2023-04-07 16:40:40] [INFO ] Flatten gal took : 4 ms
[2023-04-07 16:40:40] [INFO ] Applying decomposition
[2023-04-07 16:40:40] [INFO ] Flatten gal took : 3 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/graph3783671295644145240.txt' '-o' '/tmp/graph3783671295644145240.bin' '-w' '/tmp/graph3783671295644145240.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3783671295644145240.bin' '-l' '-1' '-v' '-w' '/tmp/graph3783671295644145240.weights' '-q' '0' '-e' '0.001'
[2023-04-07 16:40:41] [INFO ] Decomposing Gal with order
[2023-04-07 16:40:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 16:40:41] [INFO ] Removed a total of 4 redundant transitions.
[2023-04-07 16:40:41] [INFO ] Flatten gal took : 43 ms
[2023-04-07 16:40:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-04-07 16:40:41] [INFO ] Time to serialize gal into /tmp/LTL2246498043490147021.gal : 2 ms
[2023-04-07 16:40:41] [INFO ] Time to serialize properties into /tmp/LTL6685645963105773909.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/LTL2246498043490147021.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6685645963105773909.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.u3.capacity_c7>=1)")||(G("(i2.u9.state_c10<1)"))))))
Formula 0 simplified : G(F!"(i2.u9.state_c10<1)" & FG!"(i0.u3.capacity_c7>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10219356119620918803
[2023-04-07 16:40:56] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10219356119620918803
Running compilation step : cd /tmp/ltsmin10219356119620918803;'/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 89 ms.
Running link step : cd /tmp/ltsmin10219356119620918803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin10219356119620918803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-13 finished in 92790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0||X((X(X(X((p1||X(p2))))) U (!p0&&X(X(X((p1||X(p2))))))))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:41:11] [INFO ] Invariant cache hit.
[2023-04-07 16:41:11] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-04-07 16:41:11] [INFO ] Invariant cache hit.
[2023-04-07 16:41:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:41:11] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-04-07 16:41:11] [INFO ] Invariant cache hit.
[2023-04-07 16:41:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 602 ms :[p0, p0, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 6}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 9}, { cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=(NOT p1), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 12}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 1}, { cond=(NOT p2), acceptance={} source=9 dest: 2}], [{ cond=(NOT p2), acceptance={} source=10 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=10 dest: 4}], [{ cond=(NOT p2), acceptance={} source=11 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=11 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=12 dest: 6}, { cond=(NOT p2), acceptance={} source=12 dest: 7}]], initial=0, aps=[p0:(LT s23 1), p1:(GEQ s22 1), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10662 reset in 65 ms.
Product exploration explored 100000 steps with 10637 reset in 71 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 584 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 42 states, 160 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 2248 ms :[p0, p0, (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), false, (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=286 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 16:41:15] [INFO ] Invariant cache hit.
[2023-04-07 16:41:15] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 16:41:15] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (OR p1 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 p0 p2)), (F (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (F (OR p1 (NOT p0) p2)), (F (OR (AND p1 p0) (AND p0 p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 2487 ms. Reduced automaton from 42 states, 160 edges and 3 AP (stutter insensitive) to 30 states, 135 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1446 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 1529 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
[2023-04-07 16:41:20] [INFO ] Invariant cache hit.
[2023-04-07 16:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:41:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-07 16:41:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:41:20] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-04-07 16:41:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:41:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 16:41:20] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-07 16:41:20] [INFO ] Added : 23 causal constraints over 5 iterations in 30 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:41:20] [INFO ] Invariant cache hit.
[2023-04-07 16:41:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 16:41:21] [INFO ] Invariant cache hit.
[2023-04-07 16:41:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:41:21] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-07 16:41:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:41:21] [INFO ] Invariant cache hit.
[2023-04-07 16:41:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 32/32 places, 33/33 transitions.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 82 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Detected a total of 20/32 stabilizing places and 21/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (OR p1 (AND p0 p2))), (X (NOT (OR p1 (AND p0 p2)))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND p1 p0) p2)), (X (NOT (OR (AND p1 p0) p2))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)))), (X (X (OR p1 (AND p0 p2)))), (X (X (NOT (OR p1 (AND p0 p2))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND p1 p0) p2))), (X (X (NOT (OR (AND p1 p0) p2))))]
Knowledge based reduction with 15 factoid took 6664 ms. Reduced automaton from 30 states, 135 edges and 3 AP (stutter insensitive) to 30 states, 135 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1468 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10054 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=591 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-04-07 16:41:29] [INFO ] Invariant cache hit.
[2023-04-07 16:41:29] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-07 16:41:29] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (OR p1 (AND p0 p2))), (X (NOT (OR p1 (AND p0 p2)))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND p1 p0) p2)), (X (NOT (OR (AND p1 p0) p2))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)))), (X (X (OR p1 (AND p0 p2)))), (X (X (NOT (OR p1 (AND p0 p2))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND p1 p0) p2))), (X (X (NOT (OR (AND p1 p0) p2)))), (F (OR p1 p2)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) p0 p2)), (F (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (F (OR (AND (NOT p1) p0 p2) (AND p1 (NOT p0) p2))), (F (OR (AND p1 p0) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (OR (AND (NOT p1) (NOT p0)) (AND p1 p0) p2)), (F (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND p1 p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (OR p1 (AND p0 p2))), (F (AND p1 p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (F (AND p1 p0 p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 17 factoid took 11635 ms. Reduced automaton from 30 states, 135 edges and 3 AP (stutter insensitive) to 30 states, 135 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1503 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 1473 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
[2023-04-07 16:41:44] [INFO ] Invariant cache hit.
[2023-04-07 16:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 16:41:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-07 16:41:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 16:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 16:41:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-07 16:41:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:41:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-04-07 16:41:44] [INFO ] Computed and/alt/rep : 30/50/30 causal constraints (skipped 0 transitions) in 8 ms.
[2023-04-07 16:41:44] [INFO ] Added : 23 causal constraints over 5 iterations in 29 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 1323 ms :[(OR p0 p1), (OR p1 p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), (OR (AND (NOT p1) p0 (NOT p2)) (AND p1 (NOT p0) (NOT p2))), false, (AND p1 (NOT p0) (NOT p2)), false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false, false, (AND p1 (NOT p0) (NOT p2)), false, false, false, false, false]
Product exploration explored 100000 steps with 9456 reset in 142 ms.
Stack based approach found an accepted trace after 40997 steps with 3893 reset with depth 25 and stack size 25 in 60 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-14 finished in 34418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-04-07 16:41:45] [INFO ] Invariant cache hit.
[2023-04-07 16:41:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 16:41:45] [INFO ] Invariant cache hit.
[2023-04-07 16:41:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 16:41:45] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-04-07 16:41:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 16:41:45] [INFO ] Invariant cache hit.
[2023-04-07 16:41:45] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 32/32 places, 33/33 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CryptoMiner-PT-D10N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (OR (LT s0 1) (LT s21 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8347 reset in 65 ms.
Stack based approach found an accepted trace after 63696 steps with 5315 reset with depth 13 and stack size 13 in 40 ms.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CryptoMiner-PT-D10N100-LTLFireability-15 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-04-07 16:41:46] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
[2023-04-07 16:41:46] [INFO ] Applying decomposition
[2023-04-07 16:41:46] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin6825387979528761358
[2023-04-07 16:41:46] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2023-04-07 16:41:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:41:46] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2023-04-07 16:41:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:41:46] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2023-04-07 16:41:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 16:41:46] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6825387979528761358
Running compilation step : cd /tmp/ltsmin6825387979528761358;'/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/graph18156718875355580007.txt' '-o' '/tmp/graph18156718875355580007.bin' '-w' '/tmp/graph18156718875355580007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18156718875355580007.bin' '-l' '-1' '-v' '-w' '/tmp/graph18156718875355580007.weights' '-q' '0' '-e' '0.001'
[2023-04-07 16:41:46] [INFO ] Decomposing Gal with order
[2023-04-07 16:41:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 16:41:46] [INFO ] Removed a total of 4 redundant transitions.
[2023-04-07 16:41:46] [INFO ] Flatten gal took : 3 ms
[2023-04-07 16:41:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-04-07 16:41:46] [INFO ] Time to serialize gal into /tmp/LTLFireability3261030999034388348.gal : 1 ms
[2023-04-07 16:41:46] [INFO ] Time to serialize properties into /tmp/LTLFireability10297658666992138232.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/LTLFireability3261030999034388348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10297658666992138232.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i1.u3.capacity_c7>=1)")||(G("(i5.u10.state_c10<1)"))))))
Formula 0 simplified : G(F!"(i5.u10.state_c10<1)" & FG!"(i1.u3.capacity_c7>=1)")
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin6825387979528761358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin6825387979528761358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Initializing POR dependencies: labels 35, guards 33
pins2lts-mc-linux64( 3/ 8), 0.003: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 3/ 8), 0.003: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.020: There are 36 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.020: State length is 33, there are 39 groups
pins2lts-mc-linux64( 0/ 8), 0.020: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.020: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.020: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.020: Visible groups: 0 / 39, labels: 2 / 36
pins2lts-mc-linux64( 0/ 8), 0.020: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.020: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.104: [Blue] ~120 levels ~960 states ~4344 transitions
pins2lts-mc-linux64( 3/ 8), 0.176: [Blue] ~240 levels ~1920 states ~8040 transitions
pins2lts-mc-linux64( 3/ 8), 0.252: [Blue] ~446 levels ~3840 states ~13456 transitions
pins2lts-mc-linux64( 3/ 8), 0.297: [Blue] ~661 levels ~7680 states ~20344 transitions
pins2lts-mc-linux64( 4/ 8), 0.367: [Blue] ~317 levels ~15360 states ~37000 transitions
pins2lts-mc-linux64( 3/ 8), 0.488: [Blue] ~661 levels ~30720 states ~65840 transitions
pins2lts-mc-linux64( 3/ 8), 0.716: [Blue] ~661 levels ~61440 states ~125648 transitions
pins2lts-mc-linux64( 3/ 8), 1.072: [Blue] ~661 levels ~122880 states ~250640 transitions
pins2lts-mc-linux64( 3/ 8), 1.630: [Blue] ~661 levels ~245760 states ~504496 transitions
pins2lts-mc-linux64( 3/ 8), 2.439: [Blue] ~661 levels ~491520 states ~1027696 transitions
pins2lts-mc-linux64( 3/ 8), 3.609: [Blue] ~661 levels ~983040 states ~2065128 transitions
pins2lts-mc-linux64( 7/ 8), 5.665: [Blue] ~635 levels ~1966080 states ~4836024 transitions
pins2lts-mc-linux64( 3/ 8), 9.488: [Blue] ~661 levels ~3932160 states ~10177792 transitions
pins2lts-mc-linux64( 1/ 8), 17.059: [Blue] ~609 levels ~7864320 states ~18883048 transitions
pins2lts-mc-linux64( 1/ 8), 32.198: [Blue] ~609 levels ~15728640 states ~38009720 transitions
pins2lts-mc-linux64( 1/ 8), 65.161: [Blue] ~609 levels ~31457280 states ~76401008 transitions
pins2lts-mc-linux64( 3/ 8), 115.237: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 115.290:
pins2lts-mc-linux64( 0/ 8), 115.291: Explored 37837148 states 149745804 transitions, fanout: 3.958
pins2lts-mc-linux64( 0/ 8), 115.291: Total exploration time 115.230 sec (115.160 sec minimum, 115.203 sec on average)
pins2lts-mc-linux64( 0/ 8), 115.291: States per second: 328362, Transitions per second: 1299538
pins2lts-mc-linux64( 0/ 8), 115.291:
pins2lts-mc-linux64( 0/ 8), 115.291: State space has 37382733 states, 5769131 are accepting
pins2lts-mc-linux64( 0/ 8), 115.291: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 115.291: blue states: 37837148 (101.22%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 115.291: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 115.291: all-red states: 15683435 (41.95%), bogus 948780 (2.54%)
pins2lts-mc-linux64( 0/ 8), 115.291:
pins2lts-mc-linux64( 0/ 8), 115.291: Total memory used for local state coloring: 103.7MB
pins2lts-mc-linux64( 0/ 8), 115.291:
pins2lts-mc-linux64( 0/ 8), 115.291: Queue width: 8B, total height: 6798945, memory: 51.87MB
pins2lts-mc-linux64( 0/ 8), 115.291: Tree memory: 541.2MB, 15.2 B/state, compr.: 11.3%
pins2lts-mc-linux64( 0/ 8), 115.291: Tree fill ratio (roots/leafs): 27.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 115.291: Stored 33 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 115.291: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 115.291: Est. total memory use: 593.1MB (~1075.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6825387979528761358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6825387979528761358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((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.
[2023-04-07 17:02:35] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:02:35] [INFO ] Time to serialize gal into /tmp/LTLFireability9110086361162002968.gal : 0 ms
[2023-04-07 17:02:35] [INFO ] Time to serialize properties into /tmp/LTLFireability11752203014023401060.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/LTLFireability9110086361162002968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11752203014023401060.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 : !((G(F(("(capacity_c7>=1)")||(G("(state_c10<1)"))))))
Formula 0 simplified : G(F!"(state_c10<1)" & FG!"(capacity_c7>=1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, Intersection with reachable at ea...219
Computing Next relation with stutter on 1.07187e+07 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
28352 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,283.542,2255564,1,0,3930,1.32554e+07,22,2614,1576,1.42391e+07,7206
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CryptoMiner-PT-D10N100-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 1697410 ms.

BK_STOP 1680887254628

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CryptoMiner-PT-D10N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r517-tall-167987243500204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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