Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477400211.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 HexagonalGrid-PT-110, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477400211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 8.4K Apr 29 11:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 29 11:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 29K May 10 09:34 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 HexagonalGrid-PT-110-LTLCardinality-00
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-01
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-02
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-03
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-04
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-05
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-06
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-07
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-08
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-09
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-10
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-11
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-12
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-13
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-14
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652702936757

Running Version 202205111006
[2022-05-16 12:08:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2022-05-16 12:08:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 12:08:59] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2022-05-16 12:08:59] [INFO ] Transformed 31 places.
[2022-05-16 12:08:59] [INFO ] Transformed 42 transitions.
[2022-05-16 12:08:59] [INFO ] Parsed PT model containing 31 places and 42 transitions in 373 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HexagonalGrid-PT-110-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 19 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:08:59] [INFO ] Computed 14 place invariants in 12 ms
[2022-05-16 12:09:00] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:00] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-16 12:09:00] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:00] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-16 12:09:00] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Support contains 24 out of 31 places after structural reductions.
[2022-05-16 12:09:00] [INFO ] Flatten gal took : 51 ms
[2022-05-16 12:09:00] [INFO ] Flatten gal took : 26 ms
[2022-05-16 12:09:00] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=12 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:02] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 12:09:02] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-16 12:09:02] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 12:09:02] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA HexagonalGrid-PT-110-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA HexagonalGrid-PT-110-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(G((p0 U F(p1))))&&p0)))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 19 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:03] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:03] [INFO ] Implicit Places using invariants in 133 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 30 transition count 39
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 24 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 9 place count 24 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 18 transition count 36
Graph (trivial) has 9 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 16 transition count 36
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 36 place count 16 transition count 19
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 16 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 12 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 12 transition count 11
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 52 place count 8 transition count 11
Applied a total of 52 rules in 20 ms. Remains 8 /30 variables (removed 22) and now considering 11/42 (removed 31) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 12:09:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 12:09:03] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 12:09:03] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-16 12:09:03] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/31 places, 11/42 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/31 places, 11/42 transitions.
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s3 s1), p0:(LEQ s4 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-00 finished in 812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G((p0 U X(X(p1)))) U p2))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:03] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:04] [INFO ] Implicit Places using invariants in 121 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 491 ms :[p2, true, (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, p1, p1]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 8}, { cond=p2, acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 6}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 7}], [{ cond=p1, acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=6 dest: 8}, { cond=(AND p2 p1), acceptance={} source=6 dest: 9}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 8}, { cond=p1, acceptance={0} source=7 dest: 9}], [{ cond=p0, acceptance={} source=8 dest: 8}, { cond=true, acceptance={0} source=8 dest: 9}], [{ cond=true, acceptance={0} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 7}]], initial=0, aps=[p2:(LEQ s4 s21), p0:(LEQ 1 s12), p1:(AND (NOT (AND (LEQ 1 s12) (LEQ 2 s4))) (GT 1 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14402 reset in 692 ms.
Product exploration explored 100000 steps with 14266 reset in 471 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) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 888 ms. Reduced automaton from 10 states, 28 edges and 3 AP to 9 states, 25 edges and 3 AP.
Stuttering acceptance computed with spot in 446 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 42 rows 30 cols
[2022-05-16 12:09:07] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 12:09:07] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p2)), (F p1), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 1470 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 483 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, p1, p1]
Stuttering acceptance computed with spot in 581 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, p1, p1]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 30 cols
[2022-05-16 12:09:10] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 12:09:10] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 42 rows 30 cols
[2022-05-16 12:09:10] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 12:09:10] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 30 cols
[2022-05-16 12:09:10] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 12:09:10] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 42/42 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) p0 (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 753 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 478 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, p1, p1]
Finished random walk after 71 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (AND p1 (NOT p2))), (F (AND p0 p2)), (F p1), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 1032 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 498 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, p1, p1]
Stuttering acceptance computed with spot in 496 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, p1, p1]
Stuttering acceptance computed with spot in 469 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, p1, p1]
Product exploration explored 100000 steps with 12760 reset in 336 ms.
Product exploration explored 100000 steps with 12735 reset in 331 ms.
Applying partial POR strategy [false, false, false, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 448 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, p1, p1]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 30 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 30 transition count 46
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 5 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 46/42 (removed -4) transitions.
[2022-05-16 12:09:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 46 rows 30 cols
[2022-05-16 12:09:15] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 12:09:15] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 46/42 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 46/42 transitions.
Product exploration explored 100000 steps with 12669 reset in 457 ms.
Stack based approach found an accepted trace after 80879 steps with 10353 reset with depth 15 and stack size 5 in 393 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-01 finished in 12729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !p1)))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:16] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:16] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:16] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 12:09:16] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:16] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:16] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 105 ms :[p1, p1, true]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 3 s5), p0:(LEQ s6 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 210 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 p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 6 factoid took 130 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HexagonalGrid-PT-110-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HexagonalGrid-PT-110-LTLCardinality-04 finished in 937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(X(p0) U (p1 U p2))||p3)))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:17] [INFO ] Implicit Places using invariants in 97 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 30 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 26 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 24 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 22 transition count 38
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 31 place count 22 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 16 transition count 16
Applied a total of 40 rules in 18 ms. Remains 16 /30 variables (removed 14) and now considering 16/42 (removed 26) transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-05-16 12:09:17] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 12:09:17] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-16 12:09:17] [INFO ] Computed 6 place invariants in 9 ms
[2022-05-16 12:09:17] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/31 places, 16/42 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/31 places, 16/42 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND p2 (NOT p3)), true, (AND p2 p3), (AND p0 p2 p3)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p3 p2), acceptance={} source=2 dest: 1}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND p3 p2 p0), acceptance={} source=3 dest: 1}, { cond=(AND p3 p1 (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(GT s5 s15), p2:(LEQ s14 s8), p1:(LEQ 2 s5), p0:(AND (LEQ s14 s8) (LEQ s9 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 31 steps with 3 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-05 finished in 362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(G(!(p0 U p1)))||X(p2)))||p0)))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:18] [INFO ] Implicit Places using invariants in 55 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), p1]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s6 s17), p2:(LEQ s10 s17), p1:(LEQ s0 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Stack based approach found an accepted trace after 522 steps with 0 reset with depth 523 and stack size 514 in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-07 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X((X(X(F(p0)))||p1))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:18] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:18] [INFO ] Implicit Places using invariants in 64 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(LEQ s17 s18), p0:(OR (LEQ s17 s18) (LEQ s14 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 21910 reset in 136 ms.
Product exploration explored 100000 steps with 21953 reset in 242 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 p1) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 30 cols
[2022-05-16 12:09:20] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 12:09:20] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 42 rows 30 cols
[2022-05-16 12:09:20] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 12:09:20] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 30 cols
[2022-05-16 12:09:20] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 12:09:20] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 42/42 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))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 34 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21889 reset in 232 ms.
Product exploration explored 100000 steps with 21939 reset in 267 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 30 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 30 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 30 transition count 66
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 66/42 (removed -24) transitions.
[2022-05-16 12:09:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 66 rows 30 cols
[2022-05-16 12:09:22] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 12:09:22] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 66/42 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 66/42 transitions.
Product exploration explored 100000 steps with 22145 reset in 287 ms.
Stack based approach found an accepted trace after 3079 steps with 672 reset with depth 6 and stack size 2 in 12 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-08 finished in 4380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(p0)))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:22] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 12:09:22] [INFO ] Implicit Places using invariants in 84 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT s9 s25)], 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 1829 reset in 265 ms.
Stack based approach found an accepted trace after 96 steps with 2 reset with depth 19 and stack size 19 in 0 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-10 finished in 530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(X(G(p0)))))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:23] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:23] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:23] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 12:09:23] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2022-05-16 12:09:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:23] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:23] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s6 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 350 ms.
Stack based approach found an accepted trace after 273 steps with 0 reset with depth 274 and stack size 274 in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-12 finished in 643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&(p1 U p2))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:23] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:23] [INFO ] Implicit Places using invariants in 111 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (LEQ 1 s22) (LEQ s5 s24)), p2:(LEQ 2 s5), p1:(LEQ s5 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-13 finished in 367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0)))||F(p1)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2022-05-16 12:09:24] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 12:09:24] [INFO ] Implicit Places using invariants in 96 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 30 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 22 transition count 38
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 12 place count 22 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 14 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 12 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 10 transition count 32
Graph (trivial) has 16 edges and 10 vertex of which 4 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 7 transition count 32
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 54 place count 7 transition count 9
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 5 transition count 6
Applied a total of 59 rules in 20 ms. Remains 5 /30 variables (removed 25) and now considering 6/42 (removed 36) transitions.
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 12:09:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 12:09:24] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 12:09:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 12:09:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/31 places, 6/42 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/31 places, 6/42 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s3), p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-14 finished in 292 ms.
All properties solved by simple procedures.
Total runtime 25469 ms.

BK_STOP 1652702964734

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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="HexagonalGrid-PT-110"
export BK_EXAMINATION="LTLCardinality"
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 HexagonalGrid-PT-110, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477400211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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