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-171690585700158.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-4022, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-smll-171690585700158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.8K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 13 04:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 144K Apr 13 04:47 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 121K 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-4022-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717037897922

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-4022
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 02:58:21] [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 02:58:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:58:21] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-30 02:58:21] [INFO ] Transformed 184 places.
[2024-05-30 02:58:21] [INFO ] Transformed 156 transitions.
[2024-05-30 02:58:21] [INFO ] Parsed PT model containing 184 places and 156 transitions and 624 arcs in 295 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 3 formulas.
FORMULA TriangularGrid-PT-4022-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-4022-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-4022-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 32 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2024-05-30 02:58:22] [INFO ] Computed 77 invariants in 27 ms
[2024-05-30 02:58:22] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-30 02:58:22] [INFO ] Invariant cache hit.
[2024-05-30 02:58:23] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2024-05-30 02:58:23] [INFO ] Invariant cache hit.
[2024-05-30 02:58:23] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1366 ms. Remains : 184/184 places, 156/156 transitions.
Support contains 60 out of 184 places after structural reductions.
[2024-05-30 02:58:23] [INFO ] Flatten gal took : 93 ms
[2024-05-30 02:58:23] [INFO ] Flatten gal took : 38 ms
[2024-05-30 02:58:23] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 58 out of 184 places (down from 60) after GAL structural reductions.
Finished random walk after 221 steps, including 0 resets, run visited all 32 properties in 93 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 1 ms.
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((F(p0)||((G(!p2)&&p1) U p3))))'
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 22 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:58:24] [INFO ] Invariant cache hit.
[2024-05-30 02:58:25] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-30 02:58:25] [INFO ] Invariant cache hit.
[2024-05-30 02:58:25] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2024-05-30 02:58:25] [INFO ] Invariant cache hit.
[2024-05-30 02:58:25] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1124 ms. Remains : 184/184 places, 156/156 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 607 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s176 1)), p3:(AND (GEQ s62 1) (GEQ s142 1)), p1:(AND (GEQ s60 1) (GEQ s148 1)), p2:(AND (GEQ s54 1) (GEQ s68 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]]
Product exploration explored 100000 steps with 39143 reset in 1289 ms.
Product exploration explored 100000 steps with 38995 reset in 980 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 (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 391 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Finished random walk after 120 steps, including 0 resets, run visited all 2 properties in 23 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p3))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 556 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Support contains 4 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:58:30] [INFO ] Invariant cache hit.
[2024-05-30 02:58:30] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-30 02:58:30] [INFO ] Invariant cache hit.
[2024-05-30 02:58:31] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2024-05-30 02:58:31] [INFO ] Invariant cache hit.
[2024-05-30 02:58:31] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 975 ms. Remains : 184/184 places, 156/156 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 (NOT p3))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 347 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p3))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 309 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Product exploration explored 100000 steps with 38297 reset in 1277 ms.
Product exploration explored 100000 steps with 38606 reset in 1007 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:58:35] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-30 02:58:35] [INFO ] Invariant cache hit.
[2024-05-30 02:58:35] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 184/184 places, 156/156 transitions.
Built C files in :
/tmp/ltsmin2393264832902159634
[2024-05-30 02:58:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2393264832902159634
Running compilation step : cd /tmp/ltsmin2393264832902159634;'/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 997 ms.
Running link step : cd /tmp/ltsmin2393264832902159634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin2393264832902159634;'/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/stateBased11554137219888808210.hoa' '--buchi-type=spotba'
LTSmin run took 4792 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-00 finished in 16740 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((F(p1)&&p0)) U p1)))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:58:41] [INFO ] Invariant cache hit.
[2024-05-30 02:58:41] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-30 02:58:41] [INFO ] Invariant cache hit.
[2024-05-30 02:58:42] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-30 02:58:42] [INFO ] Invariant cache hit.
[2024-05-30 02:58:42] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 853 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s32 1) (GEQ s174 1)), p0:(AND (GEQ s32 1) (GEQ s174 1) (GEQ s17 1) (GEQ s165 1) (GEQ s44 1) (GEQ s118 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]]
Stuttering criterion allowed to conclude after 18158 steps with 3927 reset in 312 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-02 finished in 1418 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(X(F(G(F(!((F(p0) U X(p1)) U !p2)))))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:58:42] [INFO ] Invariant cache hit.
[2024-05-30 02:58:43] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-30 02:58:43] [INFO ] Invariant cache hit.
[2024-05-30 02:58:43] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-05-30 02:58:43] [INFO ] Invariant cache hit.
[2024-05-30 02:58:43] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 953 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 462 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={2} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0, 2} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={2} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(NOT p2), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0, 2} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 p2), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s58 1) (GEQ s131 1)), p0:(AND (GEQ s61 1) (GEQ s82 1)), p1:(AND (GEQ s120 1) (GEQ s150 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1322 reset in 1293 ms.
Product exploration explored 100000 steps with 1285 reset in 1360 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 2015 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Finished random walk after 1309 steps, including 0 resets, run visited all 14 properties in 43 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (AND p0 p1 p2)), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND p0 p1 (NOT p2))), (F (AND p1 (NOT p2))), (F p2), (F (AND (NOT p0) p2)), (F (AND p0 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 2337 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 332 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
[2024-05-30 02:58:52] [INFO ] Invariant cache hit.
[2024-05-30 02:58:52] [INFO ] [Real]Absence check using 76 positive place invariants in 51 ms returned sat
[2024-05-30 02:58:52] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 02:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 02:58:52] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2024-05-30 02:58:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 02:58:53] [INFO ] [Nat]Absence check using 76 positive place invariants in 43 ms returned sat
[2024-05-30 02:58:53] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 14 ms returned sat
[2024-05-30 02:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 02:58:53] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-30 02:58:53] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 02:58:53] [INFO ] Added : 59 causal constraints over 12 iterations in 334 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:58:53] [INFO ] Invariant cache hit.
[2024-05-30 02:58:54] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-30 02:58:54] [INFO ] Invariant cache hit.
[2024-05-30 02:58:54] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-05-30 02:58:54] [INFO ] Invariant cache hit.
[2024-05-30 02:58:54] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 960 ms. Remains : 184/184 places, 156/156 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 7 factoid took 2283 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Finished random walk after 235 steps, including 0 resets, run visited all 14 properties in 27 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (AND p1 p2 p0)), (F (AND p1 p2)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 p2 (NOT p0))), (F (AND p1 (NOT p2) p0)), (F (AND p1 (NOT p2))), (F p2), (F (AND p2 (NOT p0))), (F (AND p2 p0)), (F (AND (NOT p1) p2 p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 3081 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 433 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 412 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
[2024-05-30 02:59:01] [INFO ] Invariant cache hit.
[2024-05-30 02:59:01] [INFO ] [Real]Absence check using 76 positive place invariants in 47 ms returned sat
[2024-05-30 02:59:01] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-30 02:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:01] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-05-30 02:59:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 02:59:02] [INFO ] [Nat]Absence check using 76 positive place invariants in 54 ms returned sat
[2024-05-30 02:59:02] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 12 ms returned sat
[2024-05-30 02:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:02] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-05-30 02:59:02] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 02:59:02] [INFO ] Added : 59 causal constraints over 12 iterations in 343 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 463 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1293 reset in 1436 ms.
Product exploration explored 100000 steps with 1312 reset in 1160 ms.
Built C files in :
/tmp/ltsmin4395053236335094429
[2024-05-30 02:59:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4395053236335094429
Running compilation step : cd /tmp/ltsmin4395053236335094429;'/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 567 ms.
Running link step : cd /tmp/ltsmin4395053236335094429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4395053236335094429;'/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/stateBased16785180797257932539.hoa' '--buchi-type=spotba'
LTSmin run took 1373 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-04 finished in 25225 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&&G(!p1)) U p2))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:08] [INFO ] Invariant cache hit.
[2024-05-30 02:59:08] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-30 02:59:08] [INFO ] Invariant cache hit.
[2024-05-30 02:59:08] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-30 02:59:08] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-30 02:59:08] [INFO ] Invariant cache hit.
[2024-05-30 02:59:08] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 679 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p2 (AND (NOT p0) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s43 1) (GEQ s181 1)), p0:(AND (GEQ s33 1) (GEQ s175 1)), p1:(AND (GEQ s57 1) (GEQ s90 1) (GEQ s33 1) (GEQ s175 1))], nbAcceptance=2, 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 41 reset in 1185 ms.
Product exploration explored 100000 steps with 45 reset in 1319 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 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 (AND (NOT p0) (NOT p1)))), (X (NOT (OR p2 (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (OR p2 (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR p2 (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 919 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Finished random walk after 1089 steps, including 0 resets, run visited all 7 properties in 22 ms. (steps per millisecond=49 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 (AND (NOT p0) (NOT p1)))), (X (NOT (OR p2 (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (OR p2 (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR p2 (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 1064 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:13] [INFO ] Invariant cache hit.
[2024-05-30 02:59:14] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-30 02:59:14] [INFO ] Invariant cache hit.
[2024-05-30 02:59:14] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2024-05-30 02:59:14] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-30 02:59:14] [INFO ] Invariant cache hit.
[2024-05-30 02:59:14] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1050 ms. Remains : 184/184 places, 156/156 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 (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) p2))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (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 (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) p2)))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 906 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Finished random walk after 393 steps, including 0 resets, run visited all 7 properties in 18 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) p2))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (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 (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) p2)))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (AND (NOT p1) (NOT p0)) p2))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))]
Knowledge based reduction with 5 factoid took 1401 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 39 reset in 1463 ms.
Product exploration explored 100000 steps with 40 reset in 1025 ms.
Built C files in :
/tmp/ltsmin9064406963201770735
[2024-05-30 02:59:20] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2024-05-30 02:59:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 02:59:20] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2024-05-30 02:59:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 02:59:20] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2024-05-30 02:59:20] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 02:59:20] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9064406963201770735
Running compilation step : cd /tmp/ltsmin9064406963201770735;'/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 649 ms.
Running link step : cd /tmp/ltsmin9064406963201770735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9064406963201770735;'/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/stateBased6143949458632513941.hoa' '--buchi-type=spotba'
LTSmin run took 1210 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-05 finished in 14433 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)&&(F(p1) U X((G(!p0) U X(G(p2)))))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:22] [INFO ] Invariant cache hit.
[2024-05-30 02:59:22] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-30 02:59:22] [INFO ] Invariant cache hit.
[2024-05-30 02:59:23] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-30 02:59:23] [INFO ] Invariant cache hit.
[2024-05-30 02:59:23] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s52 1) (GEQ s77 1)), p1:(AND (GEQ s58 1) (GEQ s140 1)), p2:(AND (GEQ s49 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3878 reset in 1510 ms.
Product exploration explored 100000 steps with 4015 reset in 1307 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) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 995 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Finished random walk after 176 steps, including 0 resets, run visited all 10 properties in 10 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 1 factoid took 1202 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
[2024-05-30 02:59:29] [INFO ] Invariant cache hit.
[2024-05-30 02:59:29] [INFO ] [Real]Absence check using 76 positive place invariants in 48 ms returned sat
[2024-05-30 02:59:29] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 24 ms returned sat
[2024-05-30 02:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:30] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2024-05-30 02:59:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 02:59:30] [INFO ] [Nat]Absence check using 76 positive place invariants in 43 ms returned sat
[2024-05-30 02:59:30] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-30 02:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:30] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-05-30 02:59:30] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-30 02:59:30] [INFO ] Added : 57 causal constraints over 12 iterations in 204 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 02:59:30] [INFO ] Invariant cache hit.
[2024-05-30 02:59:31] [INFO ] [Real]Absence check using 76 positive place invariants in 31 ms returned sat
[2024-05-30 02:59:31] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 24 ms returned sat
[2024-05-30 02:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:31] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-05-30 02:59:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 02:59:31] [INFO ] [Nat]Absence check using 76 positive place invariants in 35 ms returned sat
[2024-05-30 02:59:31] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-30 02:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:31] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-30 02:59:31] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-30 02:59:31] [INFO ] Added : 57 causal constraints over 12 iterations in 222 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:31] [INFO ] Invariant cache hit.
[2024-05-30 02:59:32] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-30 02:59:32] [INFO ] Invariant cache hit.
[2024-05-30 02:59:32] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-05-30 02:59:32] [INFO ] Invariant cache hit.
[2024-05-30 02:59:32] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 750 ms. Remains : 184/184 places, 156/156 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) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 1164 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Finished random walk after 1081 steps, including 0 resets, run visited all 10 properties in 32 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 1 factoid took 1424 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
[2024-05-30 02:59:36] [INFO ] Invariant cache hit.
[2024-05-30 02:59:36] [INFO ] [Real]Absence check using 76 positive place invariants in 51 ms returned sat
[2024-05-30 02:59:36] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 28 ms returned sat
[2024-05-30 02:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:37] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-05-30 02:59:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 02:59:37] [INFO ] [Nat]Absence check using 76 positive place invariants in 46 ms returned sat
[2024-05-30 02:59:37] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-30 02:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:37] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-05-30 02:59:37] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-30 02:59:38] [INFO ] Added : 57 causal constraints over 12 iterations in 276 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-30 02:59:38] [INFO ] Invariant cache hit.
[2024-05-30 02:59:38] [INFO ] [Real]Absence check using 76 positive place invariants in 43 ms returned sat
[2024-05-30 02:59:38] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 35 ms returned sat
[2024-05-30 02:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:38] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-05-30 02:59:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 02:59:38] [INFO ] [Nat]Absence check using 76 positive place invariants in 57 ms returned sat
[2024-05-30 02:59:38] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 02:59:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 02:59:39] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2024-05-30 02:59:39] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 02:59:39] [INFO ] Added : 57 causal constraints over 12 iterations in 317 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Product exploration explored 100000 steps with 3933 reset in 1388 ms.
Product exploration explored 100000 steps with 3937 reset in 1111 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:42] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-30 02:59:42] [INFO ] Invariant cache hit.
[2024-05-30 02:59:43] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 184/184 places, 156/156 transitions.
Built C files in :
/tmp/ltsmin12407592004901169663
[2024-05-30 02:59:43] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12407592004901169663
Running compilation step : cd /tmp/ltsmin12407592004901169663;'/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 652 ms.
Running link step : cd /tmp/ltsmin12407592004901169663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12407592004901169663;'/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/stateBased16305097699219970965.hoa' '--buchi-type=spotba'
LTSmin run took 1001 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-06 finished in 22321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:44] [INFO ] Invariant cache hit.
[2024-05-30 02:59:45] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-30 02:59:45] [INFO ] Invariant cache hit.
[2024-05-30 02:59:45] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-30 02:59:45] [INFO ] Invariant cache hit.
[2024-05-30 02:59:45] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s29 1) (LT s172 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-07 finished in 741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&((F(X(F(p2))) U p3)||G(X(!p2)))))'
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:45] [INFO ] Invariant cache hit.
[2024-05-30 02:59:45] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-30 02:59:45] [INFO ] Invariant cache hit.
[2024-05-30 02:59:46] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2024-05-30 02:59:46] [INFO ] Invariant cache hit.
[2024-05-30 02:59:46] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 900 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (AND p2 (NOT p3))), true, (NOT p1), (AND (NOT p3) p2), (OR (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s50 1) (GEQ s144 1)), p0:(AND (GEQ s36 1) (GEQ s177 1)), p3:(AND (GEQ s2 1) (GEQ s96 1)), p2:(AND (GEQ s52 1) (GEQ s67 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-09 finished in 1217 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 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:46] [INFO ] Invariant cache hit.
[2024-05-30 02:59:47] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-30 02:59:47] [INFO ] Invariant cache hit.
[2024-05-30 02:59:47] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2024-05-30 02:59:47] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 02:59:47] [INFO ] Invariant cache hit.
[2024-05-30 02:59:47] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1005 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s61 1) (GEQ s92 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 3498 steps with 0 reset in 53 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-10 finished in 1130 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((p0||X(F(p1))||F(p2)))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:47] [INFO ] Invariant cache hit.
[2024-05-30 02:59:48] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-30 02:59:48] [INFO ] Invariant cache hit.
[2024-05-30 02:59:48] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2024-05-30 02:59:48] [INFO ] Invariant cache hit.
[2024-05-30 02:59:48] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 967 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s40 1) (GEQ s179 1)), p2:(OR (LT s104 1) (LT s134 1)), p1:(OR (LT s23 1) (LT s108 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33143 reset in 984 ms.
Product exploration explored 100000 steps with 33090 reset in 823 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 p2 (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Finished random walk after 119 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 231 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:51] [INFO ] Invariant cache hit.
[2024-05-30 02:59:52] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-30 02:59:52] [INFO ] Invariant cache hit.
[2024-05-30 02:59:52] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2024-05-30 02:59:52] [INFO ] Invariant cache hit.
[2024-05-30 02:59:52] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 577 ms. Remains : 184/184 places, 156/156 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 p2 (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Finished random walk after 115 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 237 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33107 reset in 1022 ms.
Product exploration explored 100000 steps with 33081 reset in 986 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 02:59:56] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 02:59:56] [INFO ] Invariant cache hit.
[2024-05-30 02:59:56] [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 255 ms. Remains : 184/184 places, 156/156 transitions.
Built C files in :
/tmp/ltsmin6671201814423248434
[2024-05-30 02:59:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6671201814423248434
Running compilation step : cd /tmp/ltsmin6671201814423248434;'/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 633 ms.
Running link step : cd /tmp/ltsmin6671201814423248434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6671201814423248434;'/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/stateBased12921810061248953678.hoa' '--buchi-type=spotba'
LTSmin run took 4053 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-11 finished in 13099 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((X(p1)&&p0))||X(((p2 U p1)&&F(p3)))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 03:00:01] [INFO ] Invariant cache hit.
[2024-05-30 03:00:01] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-30 03:00:01] [INFO ] Invariant cache hit.
[2024-05-30 03:00:01] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2024-05-30 03:00:01] [INFO ] Invariant cache hit.
[2024-05-30 03:00:01] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 332 ms :[true, (OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (NOT p1), (OR (NOT p1) (NOT p3))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(AND (GEQ s55 1) (GEQ s129 1)), p1:(AND (GEQ s55 1) (GEQ s129 1)), p2:(AND (GEQ s21 1) (GEQ s107 1)), p3:(AND (GEQ s106 1) (GEQ s136 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 159 steps with 1 reset in 3 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-12 finished in 1067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 03:00:02] [INFO ] Invariant cache hit.
[2024-05-30 03:00:02] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-30 03:00:02] [INFO ] Invariant cache hit.
[2024-05-30 03:00:02] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-30 03:00:02] [INFO ] Invariant cache hit.
[2024-05-30 03:00:02] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s52 1) (GEQ s77 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-13 finished in 948 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((X((!p1 U (G(!p1)||p2)))||p0))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 03:00:03] [INFO ] Invariant cache hit.
[2024-05-30 03:00:03] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-30 03:00:03] [INFO ] Invariant cache hit.
[2024-05-30 03:00:03] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2024-05-30 03:00:03] [INFO ] Invariant cache hit.
[2024-05-30 03:00:03] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 913 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s47 1) (LT s183 1) (AND (GEQ s50 1) (GEQ s126 1))), p2:(OR (LT s23 1) (LT s108 1)), p1:(AND (GEQ s50 1) (GEQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 34 reset in 1095 ms.
Product exploration explored 100000 steps with 39 reset in 923 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) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 556 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 03:00:07] [INFO ] Invariant cache hit.
[2024-05-30 03:00:07] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (F p0), (F (AND p0 p1 (NOT p2))), (F (AND p0 p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 882 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 03:00:08] [INFO ] Invariant cache hit.
[2024-05-30 03:00:08] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-30 03:00:08] [INFO ] Invariant cache hit.
[2024-05-30 03:00:08] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2024-05-30 03:00:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:00:08] [INFO ] Invariant cache hit.
[2024-05-30 03:00:09] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1028 ms. Remains : 184/184 places, 156/156 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) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 925 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 03:00:10] [INFO ] Invariant cache hit.
[2024-05-30 03:00:10] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 p1 (NOT p2))), (F (AND p0 p2)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))]
Knowledge based reduction with 5 factoid took 851 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 35 reset in 854 ms.
Product exploration explored 100000 steps with 38 reset in 915 ms.
Built C files in :
/tmp/ltsmin9053833623685588856
[2024-05-30 03:00:13] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2024-05-30 03:00:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:00:13] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2024-05-30 03:00:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:00:13] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2024-05-30 03:00:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:00:13] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9053833623685588856
Running compilation step : cd /tmp/ltsmin9053833623685588856;'/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 580 ms.
Running link step : cd /tmp/ltsmin9053833623685588856;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9053833623685588856;'/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/stateBased3292790715215308645.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 03:00:28] [INFO ] Invariant cache hit.
[2024-05-30 03:00:28] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-30 03:00:28] [INFO ] Invariant cache hit.
[2024-05-30 03:00:29] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-30 03:00:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 03:00:29] [INFO ] Invariant cache hit.
[2024-05-30 03:00:29] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 773 ms. Remains : 184/184 places, 156/156 transitions.
Built C files in :
/tmp/ltsmin15457243985046153891
[2024-05-30 03:00:29] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2024-05-30 03:00:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:00:29] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2024-05-30 03:00:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:00:29] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2024-05-30 03:00:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:00:29] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15457243985046153891
Running compilation step : cd /tmp/ltsmin15457243985046153891;'/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 764 ms.
Running link step : cd /tmp/ltsmin15457243985046153891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15457243985046153891;'/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/stateBased9055222491300828154.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 03:00:44] [INFO ] Flatten gal took : 18 ms
[2024-05-30 03:00:44] [INFO ] Flatten gal took : 17 ms
[2024-05-30 03:00:44] [INFO ] Time to serialize gal into /tmp/LTL8318556363199777232.gal : 6 ms
[2024-05-30 03:00:44] [INFO ] Time to serialize properties into /tmp/LTL8498666110292472466.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/LTL8318556363199777232.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1168757165246620449.hoa' '-atoms' '/tmp/LTL8498666110292472466.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...317
Loading property file /tmp/LTL8498666110292472466.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1168757165246620449.hoa
Detected timeout of ITS tools.
[2024-05-30 03:00:59] [INFO ] Flatten gal took : 14 ms
[2024-05-30 03:00:59] [INFO ] Flatten gal took : 13 ms
[2024-05-30 03:00:59] [INFO ] Time to serialize gal into /tmp/LTL17627149726297682610.gal : 4 ms
[2024-05-30 03:00:59] [INFO ] Time to serialize properties into /tmp/LTL8054969867104199223.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17627149726297682610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8054969867104199223.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 : !((F(G(("((pb3_4_7<1)||(pol3_4_7<1))")||((X((!("((pbl_2_2>=1)&&(po1_2_3>=1))"))U(("((pb2_3_4<1)||(pil2_3_3<1))")||(G(!("((pbl_2_2>=1)&...215
Formula 0 simplified : GF(!"((pb3_4_7<1)||(pol3_4_7<1))" & !"((pbl_2_2>=1)&&(po1_2_3>=1))" & X("((pbl_2_2>=1)&&(po1_2_3>=1))" M !"((pb2_3_4<1)||(pil2_3_3<1...160
Detected timeout of ITS tools.
[2024-05-30 03:01:14] [INFO ] Flatten gal took : 21 ms
[2024-05-30 03:01:14] [INFO ] Applying decomposition
[2024-05-30 03:01:14] [INFO ] Flatten gal took : 13 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/graph14755503723455802181.txt' '-o' '/tmp/graph14755503723455802181.bin' '-w' '/tmp/graph14755503723455802181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14755503723455802181.bin' '-l' '-1' '-v' '-w' '/tmp/graph14755503723455802181.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:01:14] [INFO ] Decomposing Gal with order
[2024-05-30 03:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:01:14] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-30 03:01:15] [INFO ] Flatten gal took : 75 ms
[2024-05-30 03:01:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 03:01:15] [INFO ] Time to serialize gal into /tmp/LTL15991496107033629944.gal : 6 ms
[2024-05-30 03:01:15] [INFO ] Time to serialize properties into /tmp/LTL4514804232765119390.ltl : 27 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/LTL15991496107033629944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4514804232765119390.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...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i4.u4.pb3_4_7<1)||(i4.u60.pol3_4_7<1))")||((X((!("((i0.u0.pbl_2_2>=1)&&(i0.u62.po1_2_3>=1))"))U(("((i14.u10.pb2_3_4<1)||(i7...282
Formula 0 simplified : GF(!"((i0.u0.pbl_2_2>=1)&&(i0.u62.po1_2_3>=1))" & !"((i4.u4.pb3_4_7<1)||(i4.u60.pol3_4_7<1))" & X("((i0.u0.pbl_2_2>=1)&&(i0.u62.po1_...214
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16174729083256406850
[2024-05-30 03:01:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16174729083256406850
Running compilation step : cd /tmp/ltsmin16174729083256406850;'/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 538 ms.
Running link step : cd /tmp/ltsmin16174729083256406850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16174729083256406850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TriangularGrid-PT-4022-LTLFireability-14 finished in 102184 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 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 03:01:45] [INFO ] Invariant cache hit.
[2024-05-30 03:01:45] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-30 03:01:45] [INFO ] Invariant cache hit.
[2024-05-30 03:01:45] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-05-30 03:01:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:01:45] [INFO ] Invariant cache hit.
[2024-05-30 03:01:46] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1012 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-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 s59 1) (GEQ s81 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 1606 reset in 1414 ms.
Product exploration explored 100000 steps with 1642 reset in 1119 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 324 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 223 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-05-30 03:01:49] [INFO ] Invariant cache hit.
[2024-05-30 03:01:50] [INFO ] [Real]Absence check using 76 positive place invariants in 208 ms returned sat
[2024-05-30 03:01:50] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 03:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:01:50] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2024-05-30 03:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:01:50] [INFO ] [Nat]Absence check using 76 positive place invariants in 44 ms returned sat
[2024-05-30 03:01:50] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-30 03:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:01:50] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2024-05-30 03:01:50] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-30 03:01:51] [INFO ] Added : 58 causal constraints over 12 iterations in 299 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 03:01:51] [INFO ] Invariant cache hit.
[2024-05-30 03:01:51] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-30 03:01:51] [INFO ] Invariant cache hit.
[2024-05-30 03:01:51] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-30 03:01:51] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:01:51] [INFO ] Invariant cache hit.
[2024-05-30 03:01:52] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 837 ms. Remains : 184/184 places, 156/156 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2024-05-30 03:01:52] [INFO ] Invariant cache hit.
[2024-05-30 03:01:53] [INFO ] [Real]Absence check using 76 positive place invariants in 127 ms returned sat
[2024-05-30 03:01:53] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-30 03:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 03:01:53] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-30 03:01:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 03:01:53] [INFO ] [Nat]Absence check using 76 positive place invariants in 50 ms returned sat
[2024-05-30 03:01:53] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-30 03:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 03:01:53] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2024-05-30 03:01:53] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 03:01:54] [INFO ] Added : 58 causal constraints over 12 iterations in 308 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1655 reset in 1446 ms.
Product exploration explored 100000 steps with 1665 reset in 1321 ms.
Built C files in :
/tmp/ltsmin12569582432196489109
[2024-05-30 03:01:57] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2024-05-30 03:01:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:01:57] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2024-05-30 03:01:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:01:57] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2024-05-30 03:01:57] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:01:57] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12569582432196489109
Running compilation step : cd /tmp/ltsmin12569582432196489109;'/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 663 ms.
Running link step : cd /tmp/ltsmin12569582432196489109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12569582432196489109;'/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/stateBased2707533485619358669.hoa' '--buchi-type=spotba'
LTSmin run took 515 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-4022-LTLFireability-15 finished in 13109 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((X((!p1 U (G(!p1)||p2)))||p0))))'
Found a Lengthening insensitive property : TriangularGrid-PT-4022-LTLFireability-14
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 03:01:58] [INFO ] Invariant cache hit.
[2024-05-30 03:01:58] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-30 03:01:58] [INFO ] Invariant cache hit.
[2024-05-30 03:01:59] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2024-05-30 03:01:59] [INFO ] Invariant cache hit.
[2024-05-30 03:01:59] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1038 ms. Remains : 184/184 places, 156/156 transitions.
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s47 1) (LT s183 1) (AND (GEQ s50 1) (GEQ s126 1))), p2:(OR (LT s23 1) (LT s108 1)), p1:(AND (GEQ s50 1) (GEQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 38 reset in 1068 ms.
Product exploration explored 100000 steps with 38 reset in 890 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) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 451 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 03:02:02] [INFO ] Invariant cache hit.
[2024-05-30 03:02:02] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (F p0), (F (AND p0 p1 (NOT p2))), (F (AND p0 p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 817 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-30 03:02:03] [INFO ] Invariant cache hit.
[2024-05-30 03:02:03] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-30 03:02:03] [INFO ] Invariant cache hit.
[2024-05-30 03:02:04] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-30 03:02:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 03:02:04] [INFO ] Invariant cache hit.
[2024-05-30 03:02:04] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 942 ms. Remains : 184/184 places, 156/156 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) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 860 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 03:02:05] [INFO ] Invariant cache hit.
[2024-05-30 03:02:05] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 p1 (NOT p2))), (F (AND p0 p2)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))]
Knowledge based reduction with 5 factoid took 1074 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 40 reset in 1121 ms.
Product exploration explored 100000 steps with 36 reset in 907 ms.
Built C files in :
/tmp/ltsmin5172871210705082890
[2024-05-30 03:02:09] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2024-05-30 03:02:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:02:09] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2024-05-30 03:02:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:02:09] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2024-05-30 03:02:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:02:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5172871210705082890
Running compilation step : cd /tmp/ltsmin5172871210705082890;'/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 664 ms.
Running link step : cd /tmp/ltsmin5172871210705082890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5172871210705082890;'/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/stateBased10103244647387007947.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 18 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (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 336 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 451 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2024-05-30 03:02:25] [INFO ] Redundant transitions in 1 ms returned []
[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 257 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1092 ms. Remains : 184/184 places, 156/156 transitions.
Built C files in :
/tmp/ltsmin6883047259160066096
[2024-05-30 03:02:25] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2024-05-30 03:02:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:02:25] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2024-05-30 03:02:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:02:25] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2024-05-30 03:02:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:02:25] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6883047259160066096
Running compilation step : cd /tmp/ltsmin6883047259160066096;'/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 795 ms.
Running link step : cd /tmp/ltsmin6883047259160066096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6883047259160066096;'/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/stateBased3535009100847401431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 03:02:40] [INFO ] Flatten gal took : 12 ms
[2024-05-30 03:02:40] [INFO ] Flatten gal took : 11 ms
[2024-05-30 03:02:40] [INFO ] Time to serialize gal into /tmp/LTL12320559081502617964.gal : 3 ms
[2024-05-30 03:02:40] [INFO ] Time to serialize properties into /tmp/LTL15688217304577417050.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/LTL12320559081502617964.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6954374003299992969.hoa' '-atoms' '/tmp/LTL15688217304577417050.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15688217304577417050.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6954374003299992969.hoa
Detected timeout of ITS tools.
[2024-05-30 03:02:55] [INFO ] Flatten gal took : 11 ms
[2024-05-30 03:02:55] [INFO ] Flatten gal took : 10 ms
[2024-05-30 03:02:55] [INFO ] Time to serialize gal into /tmp/LTL11183259246331218412.gal : 3 ms
[2024-05-30 03:02:55] [INFO ] Time to serialize properties into /tmp/LTL11511554295680832149.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/LTL11183259246331218412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11511554295680832149.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((pb3_4_7<1)||(pol3_4_7<1))")||((X((!("((pbl_2_2>=1)&&(po1_2_3>=1))"))U(("((pb2_3_4<1)||(pil2_3_3<1))")||(G(!("((pbl_2_2>=1)&...215
Formula 0 simplified : GF(!"((pb3_4_7<1)||(pol3_4_7<1))" & !"((pbl_2_2>=1)&&(po1_2_3>=1))" & X("((pbl_2_2>=1)&&(po1_2_3>=1))" M !"((pb2_3_4<1)||(pil2_3_3<1...160
Detected timeout of ITS tools.
[2024-05-30 03:03:10] [INFO ] Flatten gal took : 10 ms
[2024-05-30 03:03:10] [INFO ] Applying decomposition
[2024-05-30 03:03:10] [INFO ] Flatten gal took : 10 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/graph13246964401504389873.txt' '-o' '/tmp/graph13246964401504389873.bin' '-w' '/tmp/graph13246964401504389873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13246964401504389873.bin' '-l' '-1' '-v' '-w' '/tmp/graph13246964401504389873.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:03:10] [INFO ] Decomposing Gal with order
[2024-05-30 03:03:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:03:10] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-30 03:03:10] [INFO ] Flatten gal took : 30 ms
[2024-05-30 03:03:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 03:03:10] [INFO ] Time to serialize gal into /tmp/LTL4003938605444907774.gal : 5 ms
[2024-05-30 03:03:10] [INFO ] Time to serialize properties into /tmp/LTL11009609256887273831.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/LTL4003938605444907774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11009609256887273831.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...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i9.u15.pb3_4_7<1)||(i9.u59.pol3_4_7<1))")||((X((!("((i15.u5.pbl_2_2>=1)&&(i15.u61.po1_2_3>=1))"))U(("((i3.u7.pb2_3_4<1)||(i...288
Formula 0 simplified : GF(!"((i9.u15.pb3_4_7<1)||(i9.u59.pol3_4_7<1))" & !"((i15.u5.pbl_2_2>=1)&&(i15.u61.po1_2_3>=1))" & X("((i15.u5.pbl_2_2>=1)&&(i15.u61...218
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15891501577833292113
[2024-05-30 03:03:25] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15891501577833292113
Running compilation step : cd /tmp/ltsmin15891501577833292113;'/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 410 ms.
Running link step : cd /tmp/ltsmin15891501577833292113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15891501577833292113;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TriangularGrid-PT-4022-LTLFireability-14 finished in 102541 ms.
[2024-05-30 03:03:40] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
[2024-05-30 03:03:40] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin9911456106160178358
[2024-05-30 03:03:40] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2024-05-30 03:03:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:03:40] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2024-05-30 03:03:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:03:40] [INFO ] Flatten gal took : 20 ms
[2024-05-30 03:03:40] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2024-05-30 03:03:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 03:03:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9911456106160178358
Running compilation step : cd /tmp/ltsmin9911456106160178358;'/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/graph525629181872039368.txt' '-o' '/tmp/graph525629181872039368.bin' '-w' '/tmp/graph525629181872039368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph525629181872039368.bin' '-l' '-1' '-v' '-w' '/tmp/graph525629181872039368.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:03:40] [INFO ] Decomposing Gal with order
[2024-05-30 03:03:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:03:41] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-30 03:03:41] [INFO ] Flatten gal took : 32 ms
[2024-05-30 03:03:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 03:03:41] [INFO ] Time to serialize gal into /tmp/LTLFireability7464382017270319695.gal : 8 ms
[2024-05-30 03:03:41] [INFO ] Time to serialize properties into /tmp/LTLFireability12981313438055472733.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/LTLFireability7464382017270319695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12981313438055472733.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 : !((F(G(("((i11.u15.pb3_4_7<1)||(i11.u75.pol3_4_7<1))")||(("((i0.u1.pbl_2_2>=1)&&(i0.u47.po1_2_3>=1))")||(X((!("((i0.u1.pbl_2_2>=1)&&(i...284
Formula 0 simplified : GF(!"((i0.u1.pbl_2_2>=1)&&(i0.u47.po1_2_3>=1))" & !"((i11.u15.pb3_4_7<1)||(i11.u75.pol3_4_7<1))" & X("((i0.u1.pbl_2_2>=1)&&(i0.u47.p...216
Compilation finished in 520 ms.
Running link step : cd /tmp/ltsmin9911456106160178358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9911456106160178358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: LTL layer: formula: <>([]((X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(LTLAPp2==true))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: "<>([]((X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(LTLAPp2==true))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.047: There are 160 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.048: State length is 185, there are 164 groups
pins2lts-mc-linux64( 0/ 8), 0.048: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.048: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.048: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.048: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.715: [Blue] ~120 levels ~960 states ~45920 transitions
pins2lts-mc-linux64( 7/ 8), 0.918: [Blue] ~240 levels ~1920 states ~62720 transitions
pins2lts-mc-linux64( 7/ 8), 1.079: [Blue] ~480 levels ~3840 states ~84880 transitions
pins2lts-mc-linux64( 7/ 8), 1.180: [Blue] ~587 levels ~7680 states ~95520 transitions
pins2lts-mc-linux64( 7/ 8), 1.289: [Blue] ~790 levels ~15360 states ~114272 transitions
pins2lts-mc-linux64( 7/ 8), 1.542: [Blue] ~811 levels ~30720 states ~153184 transitions
pins2lts-mc-linux64( 7/ 8), 1.925: [Blue] ~1200 levels ~61440 states ~254368 transitions
pins2lts-mc-linux64( 7/ 8), 2.639: [Blue] ~4290 levels ~122880 states ~502936 transitions
pins2lts-mc-linux64( 7/ 8), 3.914: [Blue] ~4335 levels ~245760 states ~954200 transitions
pins2lts-mc-linux64( 7/ 8), 6.111: [Blue] ~4335 levels ~491520 states ~1976232 transitions
pins2lts-mc-linux64( 4/ 8), 9.370: [Blue] ~12776 levels ~983040 states ~4051816 transitions
pins2lts-mc-linux64( 7/ 8), 15.088: [Blue] ~51411 levels ~1966080 states ~8951072 transitions
pins2lts-mc-linux64( 2/ 8), 27.117: [Blue] ~1992 levels ~3932160 states ~20357120 transitions
pins2lts-mc-linux64( 2/ 8), 49.486: [Blue] ~98749 levels ~7864320 states ~39707008 transitions
pins2lts-mc-linux64( 2/ 8), 102.120: [Blue] ~484507 levels ~15728640 states ~90517592 transitions
pins2lts-mc-linux64( 4/ 8), 205.244: [Blue] ~1845065 levels ~31457280 states ~187199344 transitions
pins2lts-mc-linux64( 4/ 8), 424.132: [Blue] ~1975736 levels ~62914560 states ~379764432 transitions
pins2lts-mc-linux64( 4/ 8), 901.105: [Blue] ~2012786 levels ~125829120 states ~797203736 transitions
pins2lts-mc-linux64( 3/ 8), 996.700: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 996.740:
pins2lts-mc-linux64( 0/ 8), 996.740: Explored 127487928 states 947019035 transitions, fanout: 7.428
pins2lts-mc-linux64( 0/ 8), 996.740: Total exploration time 996.670 sec (996.630 sec minimum, 996.649 sec on average)
pins2lts-mc-linux64( 0/ 8), 996.740: States per second: 127914, Transitions per second: 950183
pins2lts-mc-linux64( 0/ 8), 996.740:
pins2lts-mc-linux64( 0/ 8), 996.740: State space has 134216398 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 996.740: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 996.740: blue states: 127487928 (94.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 996.740: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 996.740: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 996.740:
pins2lts-mc-linux64( 0/ 8), 996.740: Total memory used for local state coloring: 350.9MB
pins2lts-mc-linux64( 0/ 8), 996.740:
pins2lts-mc-linux64( 0/ 8), 996.740: Queue width: 8B, total height: 22996599, memory: 175.45MB
pins2lts-mc-linux64( 0/ 8), 996.741: Tree memory: 1076.5MB, 8.4 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 996.741: Tree fill ratio (roots/leafs): 99.0%/20.0%
pins2lts-mc-linux64( 0/ 8), 996.741: Stored 184 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 996.741: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 996.741: Est. total memory use: 1251.9MB (~1199.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9911456106160178358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(LTLAPp2==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9911456106160178358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(LTLAPp2==true))))||(LTLAPp0==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)
Reverse transition relation is NOT exact ! Due to transitions t110, t111, t113, t114, t115, t116, t118, t119, t120, t121, t122, t123, t125, t126, t128, t12...489
Detected timeout of ITS tools.
[2024-05-30 03:25:27] [INFO ] Flatten gal took : 9 ms
[2024-05-30 03:25:27] [INFO ] Time to serialize gal into /tmp/LTLFireability8394845428213263799.gal : 2 ms
[2024-05-30 03:25:27] [INFO ] Time to serialize properties into /tmp/LTLFireability15029578077584128324.ltl : 2 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/LTLFireability8394845428213263799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15029578077584128324.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 : !((F(G(("((pb3_4_7<1)||(pol3_4_7<1))")||(("((pbl_2_2>=1)&&(po1_2_3>=1))")||(X((!("((pbl_2_2>=1)&&(po1_2_3>=1))"))U(("((pb2_3_4<1)||(pi...215
Formula 0 simplified : GF(!"((pb3_4_7<1)||(pol3_4_7<1))" & !"((pbl_2_2>=1)&&(po1_2_3>=1))" & X("((pbl_2_2>=1)&&(po1_2_3>=1))" M !"((pb2_3_4<1)||(pil2_3_3<1...160
Detected timeout of ITS tools.
[2024-05-30 03:47:16] [INFO ] Flatten gal took : 558 ms
[2024-05-30 03:47:18] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-30 03:47:18] [INFO ] Transformed 184 places.
[2024-05-30 03:47:18] [INFO ] Transformed 156 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 03:47:18] [INFO ] Time to serialize gal into /tmp/LTLFireability13845858798831032918.gal : 13 ms
[2024-05-30 03:47:18] [INFO ] Time to serialize properties into /tmp/LTLFireability7522134116679649519.ltl : 6 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/LTLFireability13845858798831032918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7522134116679649519.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((pb3_4_7<1)||(pol3_4_7<1))")||(("((pbl_2_2>=1)&&(po1_2_3>=1))")||(X((!("((pbl_2_2>=1)&&(po1_2_3>=1))"))U(("((pb2_3_4<1)||(pi...215
Formula 0 simplified : GF(!"((pb3_4_7<1)||(pol3_4_7<1))" & !"((pbl_2_2>=1)&&(po1_2_3>=1))" & X("((pbl_2_2>=1)&&(po1_2_3>=1))" M !"((pb2_3_4<1)||(pil2_3_3<1...160
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4939460 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15983012 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-4022"
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-4022, 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-171690585700158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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