Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 04:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 183K May 18 16:43 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 TriangularGrid-PT-5020-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-5020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717038050057

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-5020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 03:00:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 03:00:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 03:00:53] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-30 03:00:53] [INFO ] Transformed 280 places.
[2024-05-30 03:00:53] [INFO ] Transformed 240 transitions.
[2024-05-30 03:00:53] [INFO ] Parsed PT model containing 280 places and 240 transitions and 960 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA TriangularGrid-PT-5020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5020-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5020-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5020-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 60 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 280 cols
[2024-05-30 03:00:54] [INFO ] Computed 116 invariants in 44 ms
[2024-05-30 03:00:55] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-05-30 03:00:55] [INFO ] Invariant cache hit.
[2024-05-30 03:00:55] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
[2024-05-30 03:00:55] [INFO ] Invariant cache hit.
[2024-05-30 03:00:56] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2196 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 56 out of 280 places after structural reductions.
[2024-05-30 03:00:56] [INFO ] Flatten gal took : 105 ms
[2024-05-30 03:00:56] [INFO ] Flatten gal took : 51 ms
[2024-05-30 03:00:56] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 54 out of 280 places (down from 56) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 03:00:57] [INFO ] Invariant cache hit.
[2024-05-30 03:00:57] [INFO ] [Real]Absence check using 115 positive place invariants in 31 ms returned sat
[2024-05-30 03:00:57] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 03:00:57] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA TriangularGrid-PT-5020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 22 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:00:58] [INFO ] Invariant cache hit.
[2024-05-30 03:00:58] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-30 03:00:58] [INFO ] Invariant cache hit.
[2024-05-30 03:00:58] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2024-05-30 03:00:58] [INFO ] Invariant cache hit.
[2024-05-30 03:00:59] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1241 ms. Remains : 280/280 places, 240/240 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 411 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s99 1) (LT s114 1)), p0:(AND (OR (LT s99 1) (LT s114 1)) (OR (AND (GEQ s81 1) (GEQ s104 1)) (AND (GEQ s82 1) (GEQ s195 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-00 finished in 1730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:00:59] [INFO ] Invariant cache hit.
[2024-05-30 03:01:00] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-30 03:01:00] [INFO ] Invariant cache hit.
[2024-05-30 03:01:00] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-05-30 03:01:00] [INFO ] Invariant cache hit.
[2024-05-30 03:01:01] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1602 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s41 1) (LT s260 1)), p0:(OR (LT s84 1) (LT s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 401 steps with 0 reset in 30 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-01 finished in 1894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 32 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:01:01] [INFO ] Invariant cache hit.
[2024-05-30 03:01:02] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-30 03:01:02] [INFO ] Invariant cache hit.
[2024-05-30 03:01:02] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2024-05-30 03:01:02] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-30 03:01:02] [INFO ] Invariant cache hit.
[2024-05-30 03:01:03] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1479 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s33 1) (GEQ s255 1)), p1:(OR (LT s85 1) (LT s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 94 reset in 1571 ms.
Product exploration explored 100000 steps with 97 reset in 1386 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 88 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 375 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 17 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:01:07] [INFO ] Invariant cache hit.
[2024-05-30 03:01:07] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-30 03:01:07] [INFO ] Invariant cache hit.
[2024-05-30 03:01:08] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2024-05-30 03:01:08] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-30 03:01:08] [INFO ] Invariant cache hit.
[2024-05-30 03:01:08] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1431 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 354 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 238 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 371 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 101 reset in 1672 ms.
Product exploration explored 100000 steps with 91 reset in 1317 ms.
Built C files in :
/tmp/ltsmin2238082884582927581
[2024-05-30 03:01:13] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:01:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:01:13] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:01:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:01:13] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:01:13] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:01:13] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2238082884582927581
Running compilation step : cd /tmp/ltsmin2238082884582927581;'/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 1465 ms.
Running link step : cd /tmp/ltsmin2238082884582927581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin2238082884582927581;'/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/stateBased13524858840364765480.hoa' '--buchi-type=spotba'
LTSmin run took 1551 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-03 finished in 14784 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((G((F(p1)&&p0))||(p2&&X((p1 U X(p3)))))))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:01:16] [INFO ] Invariant cache hit.
[2024-05-30 03:01:16] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-30 03:01:16] [INFO ] Invariant cache hit.
[2024-05-30 03:01:17] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
[2024-05-30 03:01:17] [INFO ] Invariant cache hit.
[2024-05-30 03:01:17] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1465 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 541 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p1), acceptance={} source=5 dest: 9}], [{ cond=(NOT p3), acceptance={} source=6 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (LT s53 1) (LT s267 1)), p0:(AND (GEQ s61 1) (GEQ s272 1)), p1:(AND (GEQ s29 1) (GEQ s253 1)), p3:(AND (GEQ s75 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 474 steps with 4 reset in 14 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-04 finished in 2061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0)) U G(p1)) U X(p2)))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:01:18] [INFO ] Invariant cache hit.
[2024-05-30 03:01:19] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-30 03:01:19] [INFO ] Invariant cache hit.
[2024-05-30 03:01:19] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2024-05-30 03:01:19] [INFO ] Invariant cache hit.
[2024-05-30 03:01:20] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1486 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p2), (AND p1 (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s45 1) (GEQ s262 1) (NOT (AND (GEQ s80 1) (GEQ s194 1)))), p0:(AND (GEQ s95 1) (GEQ s127 1)), p2:(AND (NOT (AND (GEQ s45 1) (GEQ s262 1))) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1185 reset in 1853 ms.
Product exploration explored 100000 steps with 1221 reset in 1701 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 945 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (NOT p1), false, false, false, false]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-30 03:01:25] [INFO ] Invariant cache hit.
[2024-05-30 03:01:25] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p2 (NOT p1))), (F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 1345 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 476 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (NOT p1), false, false, false, false]
Stuttering acceptance computed with spot in 491 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (NOT p1), false, false, false, false]
[2024-05-30 03:01:28] [INFO ] Invariant cache hit.
[2024-05-30 03:01:28] [INFO ] [Real]Absence check using 115 positive place invariants in 223 ms returned sat
[2024-05-30 03:01:28] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-30 03:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:01:30] [INFO ] [Real]Absence check using state equation in 1469 ms returned sat
[2024-05-30 03:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:01:30] [INFO ] [Nat]Absence check using 115 positive place invariants in 428 ms returned sat
[2024-05-30 03:01:30] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-30 03:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:01:31] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2024-05-30 03:01:31] [INFO ] Computed and/alt/rep : 165/615/165 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 03:01:32] [INFO ] Added : 150 causal constraints over 31 iterations in 943 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 10 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:01:32] [INFO ] Invariant cache hit.
[2024-05-30 03:01:32] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-30 03:01:32] [INFO ] Invariant cache hit.
[2024-05-30 03:01:32] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-05-30 03:01:32] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-30 03:01:32] [INFO ] Invariant cache hit.
[2024-05-30 03:01:33] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 959 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 828 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (NOT p1), false, false, false, false]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-30 03:01:34] [INFO ] Invariant cache hit.
[2024-05-30 03:01:34] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (NOT (AND p1 p2 (NOT p0)))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) p2 p0)), (F p2), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 14 factoid took 1617 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (NOT p1), false, false, false, false]
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (NOT p1), false, false, false, false]
[2024-05-30 03:01:37] [INFO ] Invariant cache hit.
[2024-05-30 03:01:37] [INFO ] [Real]Absence check using 115 positive place invariants in 144 ms returned sat
[2024-05-30 03:01:37] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-30 03:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:01:38] [INFO ] [Real]Absence check using state equation in 1299 ms returned sat
[2024-05-30 03:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:01:39] [INFO ] [Nat]Absence check using 115 positive place invariants in 281 ms returned sat
[2024-05-30 03:01:39] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-30 03:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:01:39] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2024-05-30 03:01:39] [INFO ] Computed and/alt/rep : 165/615/165 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 03:01:40] [INFO ] Added : 150 causal constraints over 31 iterations in 890 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p1), (NOT p1), false, false, false, false]
Product exploration explored 100000 steps with 1204 reset in 1678 ms.
Product exploration explored 100000 steps with 1246 reset in 1806 ms.
Built C files in :
/tmp/ltsmin16503464946894550190
[2024-05-30 03:01:44] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:01:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:01:44] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:01:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:01:44] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:01:44] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:01:44] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16503464946894550190
Running compilation step : cd /tmp/ltsmin16503464946894550190;'/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 754 ms.
Running link step : cd /tmp/ltsmin16503464946894550190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16503464946894550190;'/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/stateBased15706624811336472779.hoa' '--buchi-type=spotba'
LTSmin run took 1715 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-07 finished in 28391 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))&&(F(p1) U p2)))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:01:46] [INFO ] Invariant cache hit.
[2024-05-30 03:01:47] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-30 03:01:47] [INFO ] Invariant cache hit.
[2024-05-30 03:01:47] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2024-05-30 03:01:47] [INFO ] Invariant cache hit.
[2024-05-30 03:01:48] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1265 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s238 1)), p1:(AND (GEQ s93 1) (GEQ s111 1)), p0:(AND (GEQ s57 1) (GEQ s177 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 35370 reset in 1522 ms.
Product exploration explored 100000 steps with 34088 reset in 1348 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 483 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 603 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:01:52] [INFO ] Invariant cache hit.
[2024-05-30 03:01:53] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-30 03:01:53] [INFO ] Invariant cache hit.
[2024-05-30 03:01:53] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
[2024-05-30 03:01:53] [INFO ] Invariant cache hit.
[2024-05-30 03:01:54] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1428 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 205 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 145 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 248 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 37848 steps with 12560 reset in 783 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-08 finished in 8945 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))&&(p1 U (p2||G(p1)))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:01:55] [INFO ] Invariant cache hit.
[2024-05-30 03:01:56] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-30 03:01:56] [INFO ] Invariant cache hit.
[2024-05-30 03:01:57] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2024-05-30 03:01:57] [INFO ] Invariant cache hit.
[2024-05-30 03:01:57] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1518 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s4 1) (GEQ s238 1))) (OR (LT s83 1) (LT s135 1))), p1:(OR (LT s83 1) (LT s135 1)), p0:(AND (GEQ s97 1) (GEQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 464 steps with 5 reset in 16 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-10 finished in 1728 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((G(p0) U X(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 17 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:01:57] [INFO ] Invariant cache hit.
[2024-05-30 03:01:58] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-30 03:01:58] [INFO ] Invariant cache hit.
[2024-05-30 03:01:58] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
[2024-05-30 03:01:58] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-30 03:01:58] [INFO ] Invariant cache hit.
[2024-05-30 03:01:59] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1537 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={1} source=0 dest: 2}, { cond=p0, acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s76 1) (GEQ s131 1)), p1:(OR (LT s83 1) (LT s135 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 32683 reset in 1524 ms.
Product exploration explored 100000 steps with 32766 reset in 1345 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 415 ms. Reduced automaton from 5 states, 19 edges and 2 AP (stutter insensitive) to 6 states, 22 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false, false]
Finished random walk after 60 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 691 ms. Reduced automaton from 6 states, 22 edges and 2 AP (stutter insensitive) to 6 states, 22 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 335 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false, false]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 15 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:02:04] [INFO ] Invariant cache hit.
[2024-05-30 03:02:04] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-30 03:02:04] [INFO ] Invariant cache hit.
[2024-05-30 03:02:05] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-05-30 03:02:05] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 03:02:05] [INFO ] Invariant cache hit.
[2024-05-30 03:02:05] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1588 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 8 factoid took 568 ms. Reduced automaton from 6 states, 22 edges and 2 AP (stutter insensitive) to 6 states, 22 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false, false]
Finished random walk after 104 steps, including 0 resets, run visited all 6 properties in 7 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 968 ms. Reduced automaton from 6 states, 22 edges and 2 AP (stutter insensitive) to 6 states, 22 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 335 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 334 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 334 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false, false]
Product exploration explored 100000 steps with 32966 reset in 1590 ms.
Product exploration explored 100000 steps with 32647 reset in 1449 ms.
Built C files in :
/tmp/ltsmin9139236592095683794
[2024-05-30 03:02:11] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2024-05-30 03:02:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:02:11] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2024-05-30 03:02:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:02:11] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2024-05-30 03:02:11] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:02:11] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9139236592095683794
Running compilation step : cd /tmp/ltsmin9139236592095683794;'/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 778 ms.
Running link step : cd /tmp/ltsmin9139236592095683794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9139236592095683794;'/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/stateBased2347329236618014558.hoa' '--buchi-type=spotba'
LTSmin run took 3048 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-12 finished in 18259 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((X(p0)&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:02:15] [INFO ] Invariant cache hit.
[2024-05-30 03:02:16] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-30 03:02:16] [INFO ] Invariant cache hit.
[2024-05-30 03:02:16] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2024-05-30 03:02:16] [INFO ] Invariant cache hit.
[2024-05-30 03:02:17] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1209 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, false]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s10 1) (GEQ s152 1)), p0:(OR (LT s89 1) (LT s199 1)), p1:(AND (GEQ s33 1) (GEQ s255 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28401 reset in 1330 ms.
Product exploration explored 100000 steps with 28470 reset in 1423 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
Finished random walk after 398 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 456 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
Stuttering acceptance computed with spot in 199 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
[2024-05-30 03:02:21] [INFO ] Invariant cache hit.
[2024-05-30 03:02:22] [INFO ] [Real]Absence check using 115 positive place invariants in 426 ms returned sat
[2024-05-30 03:02:22] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 03:02:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:02:22] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-05-30 03:02:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:02:22] [INFO ] [Nat]Absence check using 115 positive place invariants in 59 ms returned sat
[2024-05-30 03:02:23] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 268 ms returned sat
[2024-05-30 03:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:02:23] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2024-05-30 03:02:23] [INFO ] Computed and/alt/rep : 165/615/165 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 03:02:24] [INFO ] Added : 155 causal constraints over 31 iterations in 1091 ms. Result :sat
Could not prove EG p1
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-30 03:02:24] [INFO ] Invariant cache hit.
[2024-05-30 03:02:24] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-30 03:02:24] [INFO ] Invariant cache hit.
[2024-05-30 03:02:25] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2024-05-30 03:02:25] [INFO ] Invariant cache hit.
[2024-05-30 03:02:25] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1432 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 393 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
Finished random walk after 130 steps, including 0 resets, run visited all 6 properties in 11 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 504 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
Stuttering acceptance computed with spot in 204 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
[2024-05-30 03:02:27] [INFO ] Invariant cache hit.
[2024-05-30 03:02:28] [INFO ] [Real]Absence check using 115 positive place invariants in 438 ms returned sat
[2024-05-30 03:02:28] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 03:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:02:28] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2024-05-30 03:02:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:02:28] [INFO ] [Nat]Absence check using 115 positive place invariants in 56 ms returned sat
[2024-05-30 03:02:29] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 266 ms returned sat
[2024-05-30 03:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:02:29] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2024-05-30 03:02:29] [INFO ] Computed and/alt/rep : 165/615/165 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 03:02:30] [INFO ] Added : 155 causal constraints over 31 iterations in 912 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 198 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
Product exploration explored 100000 steps with 26549 reset in 1345 ms.
Product exploration explored 100000 steps with 26507 reset in 1456 ms.
Built C files in :
/tmp/ltsmin17980943725718566810
[2024-05-30 03:02:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17980943725718566810
Running compilation step : cd /tmp/ltsmin17980943725718566810;'/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 618 ms.
Running link step : cd /tmp/ltsmin17980943725718566810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17980943725718566810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13227297061965790484.hoa' '--buchi-type=spotba'
LTSmin run took 1246 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-14 finished in 19644 ms.
All properties solved by simple procedures.
Total runtime 101905 ms.

BK_STOP 1717038156693

--------------------
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="TriangularGrid-PT-5020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is TriangularGrid-PT-5020, 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 r439-smll-171690585700163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-5020.tgz
mv TriangularGrid-PT-5020 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 ;