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.r064-tall-162038397700773.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397700773
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 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.4K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 247K May 5 16:51 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 Dekker-PT-020-00
FORMULA_NAME Dekker-PT-020-01
FORMULA_NAME Dekker-PT-020-02
FORMULA_NAME Dekker-PT-020-03
FORMULA_NAME Dekker-PT-020-04
FORMULA_NAME Dekker-PT-020-05
FORMULA_NAME Dekker-PT-020-06
FORMULA_NAME Dekker-PT-020-07
FORMULA_NAME Dekker-PT-020-08
FORMULA_NAME Dekker-PT-020-09
FORMULA_NAME Dekker-PT-020-10
FORMULA_NAME Dekker-PT-020-11
FORMULA_NAME Dekker-PT-020-12
FORMULA_NAME Dekker-PT-020-13
FORMULA_NAME Dekker-PT-020-14
FORMULA_NAME Dekker-PT-020-15

=== Now, execution of the tool begins

BK_START 1620569641203

Running Version 0
[2021-05-09 14:14:02] [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-09 14:14:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:14:02] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-09 14:14:02] [INFO ] Transformed 100 places.
[2021-05-09 14:14:02] [INFO ] Transformed 440 transitions.
[2021-05-09 14:14:02] [INFO ] Found NUPN structural information;
[2021-05-09 14:14:02] [INFO ] Parsed PT model containing 100 places and 440 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:14:02] [INFO ] Initial state test concluded for 3 properties.
FORMULA Dekker-PT-020-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 7019 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:10] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2021-05-09 14:14:10] [INFO ] Computed 60 place invariants in 16 ms
[2021-05-09 14:14:10] [INFO ] Implicit Places using invariants in 295 ms returned [43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 82, 85, 88, 91, 94, 97]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 331 ms to find 18 implicit places.
[2021-05-09 14:14:10] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:10] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 14:14:10] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []
Starting structural reductions, iteration 1 : 82/100 places, 440/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:10] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:10] [INFO ] Computed 42 place invariants in 4 ms
[2021-05-09 14:14:10] [INFO ] Dead Transitions using invariants and state equation in 244 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/100 places, 440/440 transitions.
[2021-05-09 14:14:11] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 14:14:11] [INFO ] Flatten gal took : 71 ms
FORMULA Dekker-PT-020-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:14:11] [INFO ] Flatten gal took : 39 ms
[2021-05-09 14:14:11] [INFO ] Input system was already deterministic with 440 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=154 ) properties (out of 35) seen :31
Running SMT prover for 4 properties.
[2021-05-09 14:14:11] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:11] [INFO ] Computed 42 place invariants in 4 ms
[2021-05-09 14:14:11] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:14:11] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:14:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:14:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-09 14:14:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-09 14:14:11] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:14:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:14:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-09 14:14:11] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 8 ms returned sat
[2021-05-09 14:14:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 5 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 166 ms
[2021-05-09 14:14:12] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 12 ms.
[2021-05-09 14:14:12] [INFO ] Added : 1 causal constraints over 1 iterations in 38 ms. Result :sat
[2021-05-09 14:14:12] [INFO ] [Real]Absence check using 40 positive place invariants in 8 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:14:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Real]Added 20 Read/Feed constraints in 6 ms returned sat
[2021-05-09 14:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 173 ms
[2021-05-09 14:14:12] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2021-05-09 14:14:12] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
[2021-05-09 14:14:12] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:14:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 61 ms
[2021-05-09 14:14:12] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 11 ms.
[2021-05-09 14:14:12] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
[2021-05-09 14:14:12] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:14:12] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:14:12] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-09 14:14:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 1 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-09 14:14:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 104 ms
[2021-05-09 14:14:12] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 20 transitions) in 18 ms.
[2021-05-09 14:14:12] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 61 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:13] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:13] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 14:14:13] [INFO ] Implicit Places using invariants in 95 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 96 ms to find 2 implicit places.
[2021-05-09 14:14:13] [INFO ] Redundant transitions in 28 ms returned []
[2021-05-09 14:14:13] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:13] [INFO ] Computed 40 place invariants in 9 ms
[2021-05-09 14:14:13] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 30 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:13] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-09 14:14:13] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:13] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:13] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-020-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s13 1) (NEQ s29 1) (NEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 560 ms.
Stack based approach found an accepted trace after 124 steps with 0 reset with depth 125 and stack size 119 in 1 ms.
FORMULA Dekker-PT-020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-00 finished in 1330 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U (G(p2)&&F(p3)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 19 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:14] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:14] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 14:14:14] [INFO ] Implicit Places using invariants in 94 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 97 ms to find 2 implicit places.
[2021-05-09 14:14:14] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 14:14:14] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:14] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:14] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 14 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:14] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:14] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:14] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:14] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p2)]
Running random walk in product with property : Dekker-PT-020-01 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p1 p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2 p0), acceptance={1} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p2 p0), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND p2 p0), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s17 1) (EQ s23 1) (EQ s62 1)), p0:(AND (EQ s17 1) (EQ s23 1) (EQ s62 1)), p2:(AND (EQ s7 1) (EQ s47 1)), p3:(AND (EQ s21 1) (EQ s23 1) (EQ s62 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 554 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA Dekker-PT-020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-01 finished in 1290 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(p0)))&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:15] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:15] [INFO ] Computed 42 place invariants in 15 ms
[2021-05-09 14:14:15] [INFO ] Implicit Places using invariants in 98 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 100 ms to find 2 implicit places.
[2021-05-09 14:14:15] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:15] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:15] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:15] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:15] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:16] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Dekker-PT-020-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (NEQ s7 1) (NEQ s31 1) (NEQ s70 1)), p0:(AND (EQ s17 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 19 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-02 finished in 554 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:16] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 14:14:16] [INFO ] Implicit Places using invariants in 82 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
[2021-05-09 14:14:16] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:14:16] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 14:14:16] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Starting structural reductions, iteration 1 : 81/82 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:16] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:14:16] [INFO ] Computed 41 place invariants in 0 ms
[2021-05-09 14:14:16] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Dekker-PT-020-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s35 1) (EQ s41 1)), p2:(AND (EQ s0 1) (EQ s40 1)), p1:(AND (EQ s1 1) (EQ s33 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2861 reset in 532 ms.
Stack based approach found an accepted trace after 233 steps with 3 reset with depth 112 and stack size 106 in 2 ms.
FORMULA Dekker-PT-020-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-03 finished in 1035 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)&&G(p2)&&(G(p4)||p3)&&p0)))], workingDir=/home/mcc/execution]
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:17] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:17] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 14:14:17] [INFO ] Implicit Places using invariants in 68 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
[2021-05-09 14:14:17] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:17] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:17] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:17] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:17] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:17] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 3631 ms :[(OR (NOT p1) (NOT p2) (NOT p0) (AND (NOT p3) (NOT p4))), (OR (NOT p1) (NOT p2) (NOT p0) (AND (NOT p3) (NOT p4))), true, (NOT p1), (NOT p2), (NOT p4)]
Running random walk in product with property : Dekker-PT-020-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2) (AND (NOT p3) (NOT p4))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1) p2 p3) (AND p0 (NOT p1) p2 p4)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p2 p3) (AND p0 p2 p4)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 (NOT p3) p4), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p4), acceptance={} source=5 dest: 2}, { cond=p4, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s37 1) (EQ s56 1)), p2:(AND (EQ s17 1) (EQ s31 1) (EQ s70 1)), p3:(OR (AND (EQ s31 1) (EQ s70 1)) (AND (EQ s9 1) (EQ s13 1) (EQ s52 1))), p4:(AND (EQ s17 1) (EQ s37 1) (EQ s56 1)), p1:(AND (EQ s3 1) (EQ s7 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-04 finished in 4052 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:21] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 14:14:21] [INFO ] Implicit Places using invariants in 79 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
[2021-05-09 14:14:21] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:21] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:21] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:21] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 14:14:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:21] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:21] [INFO ] Dead Transitions using invariants and state equation in 170 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : Dekker-PT-020-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s27 1) (NEQ s37 1) (NEQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-05 finished in 487 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:21] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 14:14:21] [INFO ] Implicit Places using invariants in 82 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
[2021-05-09 14:14:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:21] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:22] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:22] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:22] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:22] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Dekker-PT-020-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s17 1) (EQ s25 1) (EQ s56 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-06 finished in 510 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:22] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:22] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 14:14:22] [INFO ] Implicit Places using invariants in 81 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
[2021-05-09 14:14:22] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:22] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:22] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:22] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:22] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:22] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:22] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:22] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s23 1) (EQ s33 1) (EQ s62 1)), p0:(AND (EQ s5 1) (EQ s21 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2453 reset in 467 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Dekker-PT-020-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-07 finished in 1007 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G((F(!p0)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:23] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:23] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 14:14:23] [INFO ] Implicit Places using invariants in 89 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 90 ms to find 2 implicit places.
[2021-05-09 14:14:23] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:23] [INFO ] Computed 40 place invariants in 17 ms
[2021-05-09 14:14:23] [INFO ] Dead Transitions using invariants and state equation in 170 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:23] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:23] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:23] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-020-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s5 1) (NEQ s23 1) (NEQ s44 1)), p1:(AND (EQ s3 1) (EQ s39 1) (EQ s78 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 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 296 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:25] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 14:14:25] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:25] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:25] [INFO ] Dead Transitions using invariants and state equation in 169 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 440/440 transitions.
Product exploration explored 100000 steps with 50000 reset in 1046 ms.
Product exploration explored 100000 steps with 50000 reset in 997 ms.
[2021-05-09 14:14:31] [INFO ] Flatten gal took : 32 ms
[2021-05-09 14:14:31] [INFO ] Flatten gal took : 29 ms
[2021-05-09 14:14:32] [INFO ] Time to serialize gal into /tmp/LTL12332651771819351304.gal : 193 ms
[2021-05-09 14:14:32] [INFO ] Time to serialize properties into /tmp/LTL16442081207180994792.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/LTL12332651771819351304.gal, -t, CGAL, -LTL, /tmp/LTL16442081207180994792.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/LTL12332651771819351304.gal -t CGAL -LTL /tmp/LTL16442081207180994792.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(((flag_1_2==0)||(flag_1_11==0))||(p1_2==0))"))||(G(("(((flag_1_1==1)&&(flag_1_19==1))&&(p1_19==1))")&&(F("(((flag_1_2==1)&&(flag_1_11==1))&&(p1_2==1))")))))))
Formula 0 simplified : !X(F"(((flag_1_2==0)||(flag_1_11==0))||(p1_2==0))" | G("(((flag_1_1==1)&&(flag_1_19==1))&&(p1_19==1))" & F"(((flag_1_2==1)&&(flag_1_11==1))&&(p1_2==1))"))
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t373, t395, t417, t439, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/420/20/440
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
29 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,0.342462,27292,1,0,910,67090,916,443,6957,39647,896
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Dekker-PT-020-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Dekker-PT-020-08 finished in 9219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X(G(p0))) U (p1 U (p2 U G(p3)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:32] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:32] [INFO ] Computed 42 place invariants in 1 ms
[2021-05-09 14:14:32] [INFO ] Implicit Places using invariants in 97 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
[2021-05-09 14:14:32] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:32] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:32] [INFO ] Dead Transitions using invariants and state equation in 180 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:32] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:32] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:32] [INFO ] Dead Transitions using invariants and state equation in 168 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Dekker-PT-020-10 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND p3 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={0} source=7 dest: 7}, { cond=(AND p3 p1), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={0} source=8 dest: 8}, { cond=(AND p3 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(AND (EQ s7 1) (EQ s27 1) (EQ s46 1)), p2:(AND (EQ s3 1) (EQ s23 1) (EQ s62 1)), p1:(OR (EQ s3 0) (EQ s23 0) (EQ s62 0)), p0:(AND (EQ s11 1) (EQ s35 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-10 finished in 690 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p1))&&G(p2)&&p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:33] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 14:14:33] [INFO ] Implicit Places using invariants in 74 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
[2021-05-09 14:14:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:33] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:33] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:33] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:33] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Running random walk in product with property : Dekker-PT-020-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s19 1) (EQ s58 1) (EQ s25 1) (EQ s37 1) (EQ s76 1)), p2:(AND (EQ s37 1) (EQ s77 1)), p1:(AND (EQ s5 1) (EQ s19 1) (EQ s58 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-11 finished in 531 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:33] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 14:14:33] [INFO ] Implicit Places using invariants in 72 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
[2021-05-09 14:14:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:33] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:33] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:33] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:34] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-13 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:(OR (AND (EQ s11 1) (EQ s23 1) (EQ s50 1)) (AND (EQ s13 1) (EQ s39 1) (EQ s52 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 Dekker-PT-020-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-13 finished in 437 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&X(X(X(p1)))))||F(G(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:34] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:34] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 14:14:34] [INFO ] Implicit Places using invariants in 80 ms returned [40, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
[2021-05-09 14:14:34] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:34] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-09 14:14:34] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Starting structural reductions, iteration 1 : 80/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:34] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2021-05-09 14:14:34] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-09 14:14:34] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Dekker-PT-020-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NEQ s5 1) (NEQ s45 1)), p2:(AND (EQ s9 1) (EQ s19 1) (EQ s58 1)), p1:(AND (EQ s19 1) (EQ s37 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 472 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 0 ms.
FORMULA Dekker-PT-020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-14 finished in 982 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)||F((X(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2021-05-09 14:14:35] [INFO ] Computed 42 place invariants in 0 ms
[2021-05-09 14:14:35] [INFO ] Implicit Places using invariants in 85 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
[2021-05-09 14:14:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:14:35] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 14:14:35] [INFO ] Dead Transitions using invariants and state equation in 160 ms returned []
Starting structural reductions, iteration 1 : 81/82 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2021-05-09 14:14:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2021-05-09 14:14:35] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 14:14:35] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/82 places, 440/440 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Dekker-PT-020-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s33 1) (EQ s73 1)), p0:(AND (EQ s19 1) (EQ s29 1) (EQ s69 1)), p2:(AND (EQ s26 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1530 reset in 441 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA Dekker-PT-020-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-15 finished in 966 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620569683199

--------------------
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="Dekker-PT-020"
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 Dekker-PT-020, 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 r064-tall-162038397700773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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