Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 26 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 26 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 26 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 26 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 26 05:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 26 05:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 70K May 5 16:52 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-3011-00
FORMULA_NAME TriangularGrid-PT-3011-01
FORMULA_NAME TriangularGrid-PT-3011-02
FORMULA_NAME TriangularGrid-PT-3011-03
FORMULA_NAME TriangularGrid-PT-3011-04
FORMULA_NAME TriangularGrid-PT-3011-05
FORMULA_NAME TriangularGrid-PT-3011-06
FORMULA_NAME TriangularGrid-PT-3011-07
FORMULA_NAME TriangularGrid-PT-3011-08
FORMULA_NAME TriangularGrid-PT-3011-09
FORMULA_NAME TriangularGrid-PT-3011-10
FORMULA_NAME TriangularGrid-PT-3011-11
FORMULA_NAME TriangularGrid-PT-3011-12
FORMULA_NAME TriangularGrid-PT-3011-13
FORMULA_NAME TriangularGrid-PT-3011-14
FORMULA_NAME TriangularGrid-PT-3011-15

=== Now, execution of the tool begins

BK_START 1621453330309

Running Version 0
[2021-05-19 19:42:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 19:42:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:42:13] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2021-05-19 19:42:13] [INFO ] Transformed 108 places.
[2021-05-19 19:42:13] [INFO ] Transformed 90 transitions.
[2021-05-19 19:42:13] [INFO ] Parsed PT model containing 108 places and 90 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 19:42:13] [INFO ] Initial state test concluded for 4 properties.
FORMULA TriangularGrid-PT-3011-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-3011-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 30 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:14] [INFO ] Computed 46 place invariants in 28 ms
[2021-05-19 19:42:14] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:14] [INFO ] Computed 46 place invariants in 17 ms
[2021-05-19 19:42:14] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:14] [INFO ] Computed 46 place invariants in 9 ms
[2021-05-19 19:42:14] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
[2021-05-19 19:42:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-19 19:42:15] [INFO ] Flatten gal took : 71 ms
FORMULA TriangularGrid-PT-3011-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:42:15] [INFO ] Flatten gal took : 27 ms
[2021-05-19 19:42:15] [INFO ] Input system was already deterministic with 90 transitions.
Finished random walk after 119 steps, including 0 resets, run visited all 22 properties in 12 ms. (steps per millisecond=9 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(p0))) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:15] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-19 19:42:15] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:15] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-19 19:42:16] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:16] [INFO ] Computed 46 place invariants in 13 ms
[2021-05-19 19:42:16] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 414 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-3011-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s27 1) (GEQ s36 1)), p0:(OR (LT s29 1) (LT s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19478 reset in 940 ms.
Product exploration explored 100000 steps with 19238 reset in 655 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 19130 reset in 783 ms.
Product exploration explored 100000 steps with 19358 reset in 677 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 18 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2021-05-19 19:42:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:20] [INFO ] Computed 46 place invariants in 9 ms
[2021-05-19 19:42:20] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Product exploration explored 100000 steps with 19242 reset in 1421 ms.
Product exploration explored 100000 steps with 19191 reset in 1066 ms.
[2021-05-19 19:42:23] [INFO ] Flatten gal took : 13 ms
[2021-05-19 19:42:23] [INFO ] Flatten gal took : 11 ms
[2021-05-19 19:42:23] [INFO ] Time to serialize gal into /tmp/LTL989725367707892304.gal : 14 ms
[2021-05-19 19:42:23] [INFO ] Time to serialize properties into /tmp/LTL1727762513479269608.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL989725367707892304.gal, -t, CGAL, -LTL, /tmp/LTL1727762513479269608.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL989725367707892304.gal -t CGAL -LTL /tmp/LTL1727762513479269608.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((pbl_2_2<1)||(po3_1_1<1))"))))U(G("((pbl_1_1>=1)&&(pi1_1_1>=1))"))))
Formula 0 simplified : !(XXF"((pbl_2_2<1)||(po3_1_1<1))" U G"((pbl_1_1>=1)&&(pi1_1_1>=1))")
Reverse transition relation is NOT exact ! Due to transitions t63, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t88, t89, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/24/90
Detected timeout of ITS tools.
[2021-05-19 19:42:38] [INFO ] Flatten gal took : 13 ms
[2021-05-19 19:42:38] [INFO ] Applying decomposition
[2021-05-19 19:42:38] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14220775808727536048.txt, -o, /tmp/graph14220775808727536048.bin, -w, /tmp/graph14220775808727536048.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14220775808727536048.bin, -l, -1, -v, -w, /tmp/graph14220775808727536048.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:42:38] [INFO ] Decomposing Gal with order
[2021-05-19 19:42:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:42:38] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-19 19:42:38] [INFO ] Flatten gal took : 77 ms
[2021-05-19 19:42:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-19 19:42:38] [INFO ] Time to serialize gal into /tmp/LTL691106038123590872.gal : 99 ms
[2021-05-19 19:42:38] [INFO ] Time to serialize properties into /tmp/LTL3899461033876610911.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL691106038123590872.gal, -t, CGAL, -LTL, /tmp/LTL3899461033876610911.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL691106038123590872.gal -t CGAL -LTL /tmp/LTL3899461033876610911.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((i7.u3.pbl_2_2<1)||(i7.u33.po3_1_1<1))"))))U(G("((i5.u0.pbl_1_1>=1)&&(i5.u9.pi1_1_1>=1))"))))
Formula 0 simplified : !(XXF"((i7.u3.pbl_2_2<1)||(i7.u33.po3_1_1<1))" U G"((i5.u0.pbl_1_1>=1)&&(i5.u9.pi1_1_1>=1))")
Reverse transition relation is NOT exact ! Due to transitions t65, t66, t68, t69, t70, t71, t73, t74, t76, t77, t78, t79, t81, t82, t83, t84, t86, t88, i0.t85, i0.t67, i3.t89, i3.t80, i5.t72, i5.t63, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/24/90
Computing Next relation with stutter on 2.42921e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1302 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.0373,251844,1,0,347284,3552,1023,954338,117,39933,265190
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA TriangularGrid-PT-3011-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property TriangularGrid-PT-3011-00 finished in 37234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||X(X((F(p1) U G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:52] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-19 19:42:53] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:53] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-19 19:42:53] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:53] [INFO ] Computed 46 place invariants in 17 ms
[2021-05-19 19:42:53] [INFO ] Dead Transitions using invariants and state equation in 257 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 158 ms :[false, (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-3011-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s27 1) (LT s48 1)), p1:(AND (GEQ s70 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 19940 steps with 217 reset in 97 ms.
FORMULA TriangularGrid-PT-3011-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3011-01 finished in 1099 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F(p1)||(X(F(!p0))&&p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:53] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-19 19:42:54] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:54] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-19 19:42:54] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:54] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:42:54] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-3011-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s19 1) (GEQ s103 1)), p0:(AND (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s19 1) (GEQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 981 steps with 108 reset in 7 ms.
FORMULA TriangularGrid-PT-3011-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3011-02 finished in 625 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(G(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:54] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-19 19:42:54] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:54] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-19 19:42:54] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:54] [INFO ] Computed 46 place invariants in 9 ms
[2021-05-19 19:42:54] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : TriangularGrid-PT-3011-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(OR (LT s27 1) (LT s48 1)), p0:(OR (LT s32 1) (LT s81 1)), p1:(OR (AND (GEQ s65 1) (GEQ s83 1)) (AND (GEQ s29 1) (GEQ s84 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3011-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3011-03 finished in 579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 23 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:55] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:42:55] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:55] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-19 19:42:55] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2021-05-19 19:42:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:55] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-19 19:42:55] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-3011-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s28 1) (GEQ s43 1) (GEQ s7 1) (GEQ s59 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 576 steps with 0 reset in 4 ms.
FORMULA TriangularGrid-PT-3011-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3011-04 finished in 690 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 13 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:55] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-19 19:42:56] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:56] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:42:56] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2021-05-19 19:42:56] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:42:56] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-19 19:42:56] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 47 ms :[p0]
Running random walk in product with property : TriangularGrid-PT-3011-05 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s32 1) (LT s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3572 reset in 877 ms.
Product exploration explored 100000 steps with 3575 reset in 661 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Product exploration explored 100000 steps with 3599 reset in 724 ms.
Product exploration explored 100000 steps with 3526 reset in 599 ms.
[2021-05-19 19:42:59] [INFO ] Flatten gal took : 14 ms
[2021-05-19 19:42:59] [INFO ] Flatten gal took : 13 ms
[2021-05-19 19:42:59] [INFO ] Time to serialize gal into /tmp/LTL2131683091328202527.gal : 3 ms
[2021-05-19 19:42:59] [INFO ] Time to serialize properties into /tmp/LTL15927326903403780499.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2131683091328202527.gal, -t, CGAL, -LTL, /tmp/LTL15927326903403780499.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2131683091328202527.gal -t CGAL -LTL /tmp/LTL15927326903403780499.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((pbl_3_2>=1)&&(po2_3_1>=1))")))
Formula 0 simplified : !F"((pbl_3_2>=1)&&(po2_3_1>=1))"
Reverse transition relation is NOT exact ! Due to transitions t63, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t88, t89, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/24/90
Detected timeout of ITS tools.
[2021-05-19 19:43:14] [INFO ] Flatten gal took : 9 ms
[2021-05-19 19:43:14] [INFO ] Applying decomposition
[2021-05-19 19:43:14] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2550480455265675469.txt, -o, /tmp/graph2550480455265675469.bin, -w, /tmp/graph2550480455265675469.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2550480455265675469.bin, -l, -1, -v, -w, /tmp/graph2550480455265675469.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:43:14] [INFO ] Decomposing Gal with order
[2021-05-19 19:43:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:43:14] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-19 19:43:14] [INFO ] Flatten gal took : 26 ms
[2021-05-19 19:43:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-19 19:43:14] [INFO ] Time to serialize gal into /tmp/LTL2734011709579398726.gal : 16 ms
[2021-05-19 19:43:14] [INFO ] Time to serialize properties into /tmp/LTL10085022133298618818.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2734011709579398726.gal, -t, CGAL, -LTL, /tmp/LTL10085022133298618818.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2734011709579398726.gal -t CGAL -LTL /tmp/LTL10085022133298618818.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("((i3.u6.pbl_3_2>=1)&&(i3.u35.po2_3_1>=1))")))
Formula 0 simplified : !F"((i3.u6.pbl_3_2>=1)&&(i3.u35.po2_3_1>=1))"
Reverse transition relation is NOT exact ! Due to transitions t65, t66, t68, t69, t70, t71, t73, t74, t76, t77, t78, t79, t81, t82, t83, t84, t86, t88, i2.t85, i2.t67, i5.t89, i5.t80, i6.t72, i6.t63, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/24/90
Computing Next relation with stutter on 2.42921e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1021 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.2274,238628,1,0,347604,3781,972,1.0065e+06,117,30218,264429
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA TriangularGrid-PT-3011-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property TriangularGrid-PT-3011-05 finished in 30083 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&X(p2)))], workingDir=/home/mcc/execution]
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:43:25] [INFO ] Computed 46 place invariants in 9 ms
[2021-05-19 19:43:26] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:43:26] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:43:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:43:26] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:43:26] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-3011-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(OR (LT s30 1) (LT s38 1) (LT s27 1) (LT s36 1)), p0:(AND (GEQ s13 1) (GEQ s99 1)), p2:(AND (GEQ s71 1) (GEQ s89 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3011-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3011-06 finished in 525 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)||F((p1||(X(p2)&&G(!p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:43:26] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:43:26] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:43:26] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:43:27] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:43:27] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:43:27] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : TriangularGrid-PT-3011-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s35 1) (GEQ s53 1)), p2:(OR (LT s26 1) (LT s107 1)), p0:(OR (LT s32 1) (LT s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3670 reset in 876 ms.
Product exploration explored 100000 steps with 3632 reset in 744 ms.
Knowledge obtained : [(NOT p1), (NOT p2), p0]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 3596 reset in 716 ms.
Product exploration explored 100000 steps with 3646 reset in 757 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Support contains 6 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2021-05-19 19:43:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:43:30] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-19 19:43:30] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Product exploration explored 100000 steps with 3608 reset in 778 ms.
Product exploration explored 100000 steps with 3603 reset in 615 ms.
[2021-05-19 19:43:32] [INFO ] Flatten gal took : 8 ms
[2021-05-19 19:43:32] [INFO ] Flatten gal took : 7 ms
[2021-05-19 19:43:32] [INFO ] Time to serialize gal into /tmp/LTL11421935469059982143.gal : 1 ms
[2021-05-19 19:43:32] [INFO ] Time to serialize properties into /tmp/LTL7981878384888006907.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11421935469059982143.gal, -t, CGAL, -LTL, /tmp/LTL7981878384888006907.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11421935469059982143.gal -t CGAL -LTL /tmp/LTL7981878384888006907.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((pbl_3_2>=1)&&(po2_3_1>=1))"))||(F(("((pbl_3_5>=1)&&(pi3_3_5>=1))")||((X("((pb3_3_5<1)||(pol3_3_5<1))"))&&(G("((pbl_3_5<1)||(pi3_3_5<1))")))))))
Formula 0 simplified : !(G"((pbl_3_2>=1)&&(po2_3_1>=1))" | F("((pbl_3_5>=1)&&(pi3_3_5>=1))" | (X"((pb3_3_5<1)||(pol3_3_5<1))" & G"((pbl_3_5<1)||(pi3_3_5<1))")))
Reverse transition relation is NOT exact ! Due to transitions t63, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t88, t89, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/24/90
Detected timeout of ITS tools.
[2021-05-19 19:43:47] [INFO ] Flatten gal took : 13 ms
[2021-05-19 19:43:47] [INFO ] Applying decomposition
[2021-05-19 19:43:47] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8797826402163996806.txt, -o, /tmp/graph8797826402163996806.bin, -w, /tmp/graph8797826402163996806.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8797826402163996806.bin, -l, -1, -v, -w, /tmp/graph8797826402163996806.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:43:47] [INFO ] Decomposing Gal with order
[2021-05-19 19:43:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:43:47] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-19 19:43:47] [INFO ] Flatten gal took : 25 ms
[2021-05-19 19:43:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-19 19:43:47] [INFO ] Time to serialize gal into /tmp/LTL16720504326764605477.gal : 4 ms
[2021-05-19 19:43:47] [INFO ] Time to serialize properties into /tmp/LTL12758475545359395283.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16720504326764605477.gal, -t, CGAL, -LTL, /tmp/LTL12758475545359395283.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16720504326764605477.gal -t CGAL -LTL /tmp/LTL12758475545359395283.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i5.u6.pbl_3_2>=1)&&(i5.u39.po2_3_1>=1))"))||(F(("((i8.u8.pbl_3_5>=1)&&(i8.u26.pi3_3_5>=1))")||((X("((i8.u8.pb3_3_5<1)||(i8.u44.pol3_3_5<1))"))&&(G("((i8.u8.pbl_3_5<1)||(i8.u26.pi3_3_5<1))")))))))
Formula 0 simplified : !(G"((i5.u6.pbl_3_2>=1)&&(i5.u39.po2_3_1>=1))" | F("((i8.u8.pbl_3_5>=1)&&(i8.u26.pi3_3_5>=1))" | (X"((i8.u8.pb3_3_5<1)||(i8.u44.pol3_3_5<1))" & G"((i8.u8.pbl_3_5<1)||(i8.u26.pi3_3_5<1))")))
Reverse transition relation is NOT exact ! Due to transitions t65, t66, t68, t69, t70, t71, t73, t74, t76, t77, t78, t79, t81, t82, t83, t84, t86, t88, i4.t85, i4.t67, i7.t72, i7.t63, i8.t89, i8.t80, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/24/90
Computing Next relation with stutter on 2.42921e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11005399796783034799
[2021-05-19 19:44:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11005399796783034799
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11005399796783034799]
Compilation finished in 929 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11005399796783034799]
Link finished in 67 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||<>(((LTLAPp1==true)||(X((LTLAPp2==true))&&[](!(LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11005399796783034799]
LTSmin run took 686 ms.
FORMULA TriangularGrid-PT-3011-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-3011-08 finished in 37884 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(!p0))&&F(!p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:04] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:04] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:04] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:04] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:04] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:04] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR p1 p0), p0, p1]
Running random walk in product with property : TriangularGrid-PT-3011-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s26 1) (LT s107 1)), p0:(AND (GEQ s1 1) (GEQ s91 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3607 reset in 1036 ms.
Product exploration explored 100000 steps with 3662 reset in 603 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 90 ms :[(OR p1 p0), p0, p1]
Product exploration explored 100000 steps with 3675 reset in 608 ms.
Product exploration explored 100000 steps with 3714 reset in 735 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 128 ms :[(OR p1 p0), p0, p1]
Support contains 4 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 23 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2021-05-19 19:44:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:08] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:08] [INFO ] Dead Transitions using invariants and state equation in 138 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Product exploration explored 100000 steps with 3502 reset in 864 ms.
Product exploration explored 100000 steps with 3617 reset in 609 ms.
[2021-05-19 19:44:09] [INFO ] Flatten gal took : 6 ms
[2021-05-19 19:44:09] [INFO ] Flatten gal took : 5 ms
[2021-05-19 19:44:09] [INFO ] Time to serialize gal into /tmp/LTL10604846486619535302.gal : 2 ms
[2021-05-19 19:44:09] [INFO ] Time to serialize properties into /tmp/LTL1077636877388759018.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10604846486619535302.gal, -t, CGAL, -LTL, /tmp/LTL1077636877388759018.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10604846486619535302.gal -t CGAL -LTL /tmp/LTL1077636877388759018.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("((pb1_2_1<1)||(pol1_2_1<1))")))&&(F("((pb3_3_5>=1)&&(pol3_3_5>=1))"))))
Formula 0 simplified : !(XF"((pb1_2_1<1)||(pol1_2_1<1))" & F"((pb3_3_5>=1)&&(pol3_3_5>=1))")
Reverse transition relation is NOT exact ! Due to transitions t63, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t88, t89, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/24/90
Detected timeout of ITS tools.
[2021-05-19 19:44:25] [INFO ] Flatten gal took : 7 ms
[2021-05-19 19:44:25] [INFO ] Applying decomposition
[2021-05-19 19:44:25] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7642675290893553866.txt, -o, /tmp/graph7642675290893553866.bin, -w, /tmp/graph7642675290893553866.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7642675290893553866.bin, -l, -1, -v, -w, /tmp/graph7642675290893553866.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:44:25] [INFO ] Decomposing Gal with order
[2021-05-19 19:44:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:44:25] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-19 19:44:25] [INFO ] Flatten gal took : 18 ms
[2021-05-19 19:44:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-19 19:44:25] [INFO ] Time to serialize gal into /tmp/LTL9631442768902526376.gal : 10 ms
[2021-05-19 19:44:25] [INFO ] Time to serialize properties into /tmp/LTL1001907687639848678.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9631442768902526376.gal, -t, CGAL, -LTL, /tmp/LTL1001907687639848678.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9631442768902526376.gal -t CGAL -LTL /tmp/LTL1001907687639848678.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(F("((i7.u0.pb1_2_1<1)||(i7.u28.pol1_2_1<1))")))&&(F("((i6.u8.pb3_3_5>=1)&&(i6.u44.pol3_3_5>=1))"))))
Formula 0 simplified : !(XF"((i7.u0.pb1_2_1<1)||(i7.u28.pol1_2_1<1))" & F"((i6.u8.pb3_3_5>=1)&&(i6.u44.pol3_3_5>=1))")
Reverse transition relation is NOT exact ! Due to transitions t65, t66, t68, t69, t70, t71, t73, t74, t76, t77, t78, t79, t81, t82, t83, t84, t86, t88, i0.t85, i0.t67, i2.t72, i2.t63, i6.t89, i6.t80, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/24/90
Computing Next relation with stutter on 2.42921e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7831990078678115088
[2021-05-19 19:44:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7831990078678115088
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7831990078678115088]
Compilation finished in 675 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7831990078678115088]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7831990078678115088]
LTSmin run took 506 ms.
FORMULA TriangularGrid-PT-3011-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-3011-09 finished in 37053 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0||G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:41] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:41] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:41] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:41] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:41] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:41] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 226 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Running random walk in product with property : TriangularGrid-PT-3011-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(OR (LT s27 1) (LT s48 1)), p0:(AND (GEQ s8 1) (GEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 48 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3011-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3011-11 finished in 708 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:42] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:42] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:42] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:42] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:42] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:42] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-3011-12 automaton TGBA [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 s35 1) (GEQ s47 1) (GEQ s30 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 ms.
FORMULA TriangularGrid-PT-3011-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3011-12 finished in 641 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p1) U p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:42] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:42] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:42] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-19 19:44:43] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2021-05-19 19:44:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:43] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-19 19:44:43] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), true, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-3011-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(OR (LT s29 1) (LT s79 1)), p2:(AND (OR (LT s23 1) (LT s67 1)) (OR (LT s29 1) (LT s79 1))), p0:(AND (GEQ s57 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3011-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3011-13 finished in 654 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U (p1 U (!p2 U (p3||G(!p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:43] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:43] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:43] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:43] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2021-05-19 19:44:43] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 90 rows 108 cols
[2021-05-19 19:44:43] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-19 19:44:44] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND p2 (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3) p2 p1)]
Running random walk in product with property : TriangularGrid-PT-3011-15 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (OR (LT s70 1) (LT s88 1)) (OR (LT s4 1) (LT s93 1))), p2:(AND (GEQ s70 1) (GEQ s88 1)), p1:(AND (GEQ s31 1) (GEQ s45 1)), p0:(AND (GEQ s4 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 14390 reset in 986 ms.
Stuttering criterion allowed to conclude after 44200 steps with 6554 reset in 437 ms.
FORMULA TriangularGrid-PT-3011-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3011-15 finished in 2332 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621453486976

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TriangularGrid-PT-3011, 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 r273-smll-162123879700165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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