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-162038397700781.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-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397700781
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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.5K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 10:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 10:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 22 17:54 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 1.5M 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-050-00
FORMULA_NAME Dekker-PT-050-01
FORMULA_NAME Dekker-PT-050-02
FORMULA_NAME Dekker-PT-050-03
FORMULA_NAME Dekker-PT-050-04
FORMULA_NAME Dekker-PT-050-05
FORMULA_NAME Dekker-PT-050-06
FORMULA_NAME Dekker-PT-050-07
FORMULA_NAME Dekker-PT-050-08
FORMULA_NAME Dekker-PT-050-09
FORMULA_NAME Dekker-PT-050-10
FORMULA_NAME Dekker-PT-050-11
FORMULA_NAME Dekker-PT-050-12
FORMULA_NAME Dekker-PT-050-13
FORMULA_NAME Dekker-PT-050-14
FORMULA_NAME Dekker-PT-050-15

=== Now, execution of the tool begins

BK_START 1620570229578

Running Version 0
[2021-05-09 14:23:51] [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:23:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:23:51] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2021-05-09 14:23:51] [INFO ] Transformed 250 places.
[2021-05-09 14:23:51] [INFO ] Transformed 2600 transitions.
[2021-05-09 14:23:51] [INFO ] Found NUPN structural information;
[2021-05-09 14:23:51] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 250 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:23:51] [INFO ] Initial state test concluded for 2 properties.
FORMULA Dekker-PT-050-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 112 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 55 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:23:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2021-05-09 14:23:51] [INFO ] Computed 150 place invariants in 24 ms
[2021-05-09 14:23:52] [INFO ] Implicit Places using invariants in 390 ms returned [100, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 419 ms to find 48 implicit places.
[2021-05-09 14:23:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:23:52] [INFO ] Computed 102 place invariants in 4 ms
[2021-05-09 14:23:53] [INFO ] Dead Transitions using invariants and state equation in 1033 ms returned []
Starting structural reductions, iteration 1 : 202/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:23:53] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:23:53] [INFO ] Computed 102 place invariants in 3 ms
[2021-05-09 14:23:54] [INFO ] Dead Transitions using invariants and state equation in 900 ms returned []
Finished structural reductions, in 2 iterations. Remains : 202/250 places, 2600/2600 transitions.
[2021-05-09 14:23:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 14:23:54] [INFO ] Flatten gal took : 234 ms
FORMULA Dekker-PT-050-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:23:54] [INFO ] Flatten gal took : 147 ms
[2021-05-09 14:23:54] [INFO ] Input system was already deterministic with 2600 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1259 ms. (steps per millisecond=79 ) properties (out of 32) seen :29
Running SMT prover for 3 properties.
[2021-05-09 14:23:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:23:57] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-09 14:23:57] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:23:57] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-09 14:23:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 14:23:57] [INFO ] [Real]Added 50 Read/Feed constraints in 11 ms returned sat
[2021-05-09 14:23:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:23:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:23:57] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2021-05-09 14:23:57] [INFO ] Computed and/alt/rep : 100/150/100 causal constraints (skipped 50 transitions) in 64 ms.
[2021-05-09 14:23:57] [INFO ] Added : 0 causal constraints over 0 iterations in 97 ms. Result :sat
[2021-05-09 14:23:57] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:23:57] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Real]Added 50 Read/Feed constraints in 10 ms returned sat
[2021-05-09 14:23:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:23:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 21 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:23:57] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-09 14:23:57] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2021-05-09 14:23:58] [INFO ] Computed and/alt/rep : 100/150/100 causal constraints (skipped 50 transitions) in 54 ms.
[2021-05-09 14:23:58] [INFO ] Added : 0 causal constraints over 0 iterations in 82 ms. Result :sat
[2021-05-09 14:23:58] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2021-05-09 14:23:58] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:23:58] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-09 14:23:58] [INFO ] [Real]Added 50 Read/Feed constraints in 9 ms returned sat
[2021-05-09 14:23:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:23:58] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2021-05-09 14:23:58] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:23:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:23:58] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-09 14:23:58] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2021-05-09 14:23:58] [INFO ] Computed and/alt/rep : 100/150/100 causal constraints (skipped 50 transitions) in 44 ms.
[2021-05-09 14:23:58] [INFO ] Added : 0 causal constraints over 0 iterations in 64 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 27 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:23:58] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:23:58] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-09 14:23:58] [INFO ] Implicit Places using invariants in 398 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 402 ms to find 2 implicit places.
[2021-05-09 14:23:58] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:23:58] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:23:59] [INFO ] Dead Transitions using invariants and state equation in 966 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 22 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:23:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:23:59] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:00] [INFO ] Dead Transitions using invariants and state equation in 845 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Dekker-PT-050-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s33 0) (EQ s89 0) (EQ s188 0)), p1:(OR (NEQ s59 1) (NEQ s75 1) (NEQ s174 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 15 steps with 0 reset in 2 ms.
FORMULA Dekker-PT-050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-00 finished in 2581 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p1)||p0) U (G((F(p1)||p2))||(F(G(p3))&&(F(p1)||p4))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:01] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:24:01] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-09 14:24:01] [INFO ] Implicit Places using invariants in 386 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 390 ms to find 2 implicit places.
[2021-05-09 14:24:01] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:01] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:02] [INFO ] Dead Transitions using invariants and state equation in 977 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:02] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:02] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:03] [INFO ] Dead Transitions using invariants and state equation in 914 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Dekker-PT-050-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p4 p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p0), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1) p4 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p4 (NOT p0)), acceptance={} source=1 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p4) (NOT p0)), acceptance={} source=1 dest: 8}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3) p0), acceptance={1} source=4 dest: 4}, { cond=(AND p2 (NOT p1) p3 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p4 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p4) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p4) p0), acceptance={1} source=5 dest: 5}, { cond=(AND p2 (NOT p1) p4 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p4 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p4) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p1) p3), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (NEQ s15 1) (NEQ s33 1) (NEQ s114 1)), p1:(OR (NEQ s15 1) (NEQ s33 1) (NEQ s114 1)), p4:(OR (NEQ s15 1) (NEQ s33 1) (NEQ s114 1)), p0:(OR (NEQ s15 1) (NEQ s33 1) (NEQ s114 1)), p3:(AND (EQ s65 1) (EQ s85 1) (EQ s184 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 789 reset in 1247 ms.
Stack based approach found an accepted trace after 337 steps with 2 reset with depth 94 and stack size 94 in 5 ms.
FORMULA Dekker-PT-050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-01 finished in 3878 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U p1))], workingDir=/home/mcc/execution]
Support contains 53 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 4100 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:09] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:24:09] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-09 14:24:09] [INFO ] Implicit Places using invariants in 299 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 309 ms to find 2 implicit places.
[2021-05-09 14:24:09] [INFO ] Redundant transitions in 164 ms returned []
[2021-05-09 14:24:09] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:09] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:10] [INFO ] Dead Transitions using invariants and state equation in 902 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 55 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:10] [INFO ] Redundant transitions in 193 ms returned []
[2021-05-09 14:24:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:10] [INFO ] Computed 100 place invariants in 4 ms
[2021-05-09 14:24:11] [INFO ] Dead Transitions using invariants and state equation in 899 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Dekker-PT-050-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s10 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s50 1) (EQ s52 1) (EQ s56 1) (EQ s58 1) (EQ s60 1) (EQ s62 1) (EQ s64 1) (EQ s66 1) (EQ s68 1) (EQ s70 1) (EQ s72 1) (EQ s74 1) (EQ s76 1) (EQ s78 1) (EQ s80 1) (EQ s82 1) (EQ s84 1) (EQ s86 1) (EQ s88 1) (EQ s90 1) (EQ s92 1) (EQ s94 1) (EQ s96 1) (EQ s98 1) (EQ s154 1)), p0:(OR (NEQ s9 1) (NEQ s25 1) (NEQ s108 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]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 2 ms.
FORMULA Dekker-PT-050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-02 finished in 6762 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 104 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:11] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:24:11] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-09 14:24:12] [INFO ] Implicit Places using invariants in 376 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 378 ms to find 2 implicit places.
[2021-05-09 14:24:12] [INFO ] Redundant transitions in 62 ms returned []
[2021-05-09 14:24:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:12] [INFO ] Computed 100 place invariants in 6 ms
[2021-05-09 14:24:13] [INFO ] Dead Transitions using invariants and state equation in 974 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 72 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:13] [INFO ] Redundant transitions in 62 ms returned []
[2021-05-09 14:24:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:13] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:14] [INFO ] Dead Transitions using invariants and state equation in 882 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s85 1) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1015 reset in 1089 ms.
Stack based approach found an accepted trace after 53 steps with 1 reset with depth 34 and stack size 33 in 1 ms.
FORMULA Dekker-PT-050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-03 finished in 3694 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)&&G(p2)&&p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:15] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:24:15] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-09 14:24:15] [INFO ] Implicit Places using invariants in 338 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 341 ms to find 2 implicit places.
[2021-05-09 14:24:15] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:15] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:16] [INFO ] Dead Transitions using invariants and state equation in 942 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:16] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:17] [INFO ] Dead Transitions using invariants and state equation in 956 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Dekker-PT-050-04 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (EQ s9 1) (EQ s47 1) (EQ s146 1)), p1:(AND (EQ s19 1) (EQ s99 1) (EQ s198 1)), p0:(AND (EQ s9 1) (EQ s47 1) (EQ s146 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 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-04 finished in 2405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F((((p2 U (p3||G(p2))) U (((p2 U (p3||G(p2)))&&G(p4))||G(p5)))||p1)))||p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:17] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:24:17] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-09 14:24:18] [INFO ] Implicit Places using invariants in 320 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 328 ms to find 2 implicit places.
[2021-05-09 14:24:18] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:18] [INFO ] Computed 100 place invariants in 0 ms
[2021-05-09 14:24:19] [INFO ] Dead Transitions using invariants and state equation in 949 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:19] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:19] [INFO ] Computed 100 place invariants in 0 ms
[2021-05-09 14:24:20] [INFO ] Dead Transitions using invariants and state equation in 939 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p4) (NOT p5))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p4) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p4) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p4) (NOT p5))), (AND (NOT p1) (NOT p4) (NOT p5)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5))]
Running random walk in product with property : Dekker-PT-050-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p4 p3) (AND (NOT p0) (NOT p1) p4 p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p4 (NOT p3) p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p5) (NOT p4)) (AND (NOT p1) (NOT p5) (NOT p3) (NOT p2))), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p5 (NOT p4)) (AND (NOT p1) p5 (NOT p3) (NOT p2))), acceptance={1, 2} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p5) p4 p3) (AND (NOT p1) (NOT p5) p4 p2)), acceptance={0, 2} source=2 dest: 4}, { cond=(OR (AND (NOT p1) p5 p4 p3) (AND (NOT p1) p5 p4 p2)), acceptance={2} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p5) p4 (NOT p3) p2), acceptance={0, 1} source=2 dest: 5}, { cond=(AND (NOT p1) p5 p4 (NOT p3) p2), acceptance={1} source=2 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p1) p4 p3) (AND (NOT p1) p4 p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p4 (NOT p3) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p5) (NOT p4)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND (NOT p1) p5 (NOT p4)), acceptance={1, 2} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p5) p4), acceptance={0, 2} source=4 dest: 4}, { cond=(AND (NOT p1) p5 p4), acceptance={2} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p5) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND (NOT p1) p5 (NOT p3) (NOT p2)), acceptance={1, 2} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p5) (NOT p3) p2), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p1) p5 (NOT p3) p2), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s35 1) (NEQ s89 1) (NEQ s134 1)), p1:(OR (NEQ s23 1) (NEQ s47 1) (NEQ s146 1)), p4:(OR (NEQ s19 1) (NEQ s51 1) (NEQ s118 1)), p3:(AND (OR (NEQ s23 1) (NEQ s47 1) (NEQ s146 1)) (OR (NEQ s43 1) (NEQ s65 1) (NEQ s142 1))), p2:(OR (NEQ s43 1) (NEQ s65 1) (NEQ s142 1)), p5:(OR (NEQ s43 1) (NEQ s65 1) (NEQ s142 1) (AND (OR (NEQ s23 1) (NEQ s47 1) (NEQ s146 1)) (OR (NEQ s43 1) (NEQ s65 1) (NEQ s142 1))))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 792 ms.
Product exploration explored 100000 steps with 50000 reset in 856 ms.
Knowledge obtained : [p0, p1, p4, p3, p2, p5]
Stuttering acceptance computed with spot in 381 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p4) (NOT p5))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p4) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p4) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p4) (NOT p5))), (AND (NOT p1) (NOT p4) (NOT p5)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5))]
Product exploration explored 100000 steps with 50000 reset in 838 ms.
Product exploration explored 100000 steps with 50000 reset in 949 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p4) (NOT p5))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p4) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p4) (NOT p5))), (OR (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p4) (NOT p5))), (AND (NOT p1) (NOT p4) (NOT p5)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p5))]
Support contains 12 out of 200 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 74 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:24] [INFO ] Redundant transitions in 61 ms returned []
[2021-05-09 14:24:24] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:24] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:25] [INFO ] Dead Transitions using invariants and state equation in 862 ms returned []
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2600/2600 transitions.
Product exploration explored 100000 steps with 50000 reset in 4213 ms.
Product exploration explored 100000 steps with 50000 reset in 4098 ms.
[2021-05-09 14:24:34] [INFO ] Flatten gal took : 131 ms
[2021-05-09 14:24:34] [INFO ] Flatten gal took : 124 ms
[2021-05-09 14:24:34] [INFO ] Time to serialize gal into /tmp/LTL3129965462647554146.gal : 51 ms
[2021-05-09 14:24:34] [INFO ] Time to serialize properties into /tmp/LTL1341278934374872233.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/LTL3129965462647554146.gal, -t, CGAL, -LTL, /tmp/LTL1341278934374872233.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/LTL3129965462647554146.gal -t CGAL -LTL /tmp/LTL1341278934374872233.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(((flag_1_17==0)||(flag_1_44==0))||(p1_17==0))")||(G(F(("(((flag_1_11==0)||(flag_1_23==0))||(p1_23==0))")||((("(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))")U(("((((flag_1_11==0)||(flag_1_23==0))||(p1_23==0))&&(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0)))")||(G("(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))"))))U(((("(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))")U(("((((flag_1_11==0)||(flag_1_23==0))||(p1_23==0))&&(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0)))")||(G("(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))"))))&&(G("(((flag_1_9==0)||(flag_1_25==0))||(p1_9==0))")))||(G("((((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))||((((flag_1_11==0)||(flag_1_23==0))||(p1_23==0))&&(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))))"))))))))))
Formula 0 simplified : !X("(((flag_1_17==0)||(flag_1_44==0))||(p1_17==0))" | GF("(((flag_1_11==0)||(flag_1_23==0))||(p1_23==0))" | (("(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))" U ("((((flag_1_11==0)||(flag_1_23==0))||(p1_23==0))&&(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0)))" | G"(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))")) U ((("(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))" U ("((((flag_1_11==0)||(flag_1_23==0))||(p1_23==0))&&(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0)))" | G"(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))")) & G"(((flag_1_9==0)||(flag_1_25==0))||(p1_9==0))") | G"((((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))||((((flag_1_11==0)||(flag_1_23==0))||(p1_23==0))&&(((flag_1_21==0)||(flag_1_32==0))||(p1_21==0))))"))))
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831, t883, t935, t987, t1039, t1091, t1143, t1195, t1247, t1299, t1351, t1403, t1455, t1507, t1559, t1611, t1663, t1715, t1767, t1819, t1871, t1923, t1975, t2027, t2079, t2131, t2183, t2235, t2287, t2339, t2391, t2443, t2495, t2547, t2599, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2550/50/2600
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
538 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,5.77226,165184,1,0,5260,975700,5262,2603,35402,474837,5217
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Dekker-PT-050-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Dekker-PT-050-05 finished in 23262 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(G(p1)&&X((p2 U (G(p2)||p3))))))], workingDir=/home/mcc/execution]
Support contains 12 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:41] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:24:41] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-09 14:24:41] [INFO ] Implicit Places using invariants in 404 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 406 ms to find 2 implicit places.
[2021-05-09 14:24:41] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:41] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:42] [INFO ] Dead Transitions using invariants and state equation in 928 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:42] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:42] [INFO ] Computed 100 place invariants in 0 ms
[2021-05-09 14:24:43] [INFO ] Dead Transitions using invariants and state equation in 922 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Dekker-PT-050-06 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p3), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1 p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p3), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(OR (NEQ s39 1) (NEQ s47 1) (NEQ s138 1)), p3:(OR (NEQ s9 1) (NEQ s11 1) (NEQ s108 1)), p2:(OR (NEQ s49 1) (NEQ s85 1) (NEQ s184 1) (NEQ s9 1) (NEQ s11 1) (NEQ s108 1)), p0:(OR (NEQ s3 1) (NEQ s57 1) (NEQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-06 finished in 2478 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X((p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:43] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:24:43] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-09 14:24:43] [INFO ] Implicit Places using invariants in 358 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 361 ms to find 2 implicit places.
[2021-05-09 14:24:43] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:43] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:44] [INFO ] Dead Transitions using invariants and state equation in 952 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:44] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:24:45] [INFO ] Dead Transitions using invariants and state equation in 926 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s95 1) (EQ s104 1) (EQ s29 1) (EQ s73 1) (EQ s128 1)), p2:(AND (OR (NEQ s5 1) (NEQ s95 1) (NEQ s104 1)) (OR (NEQ s29 1) (NEQ s73 1) (NEQ s128 1))), p1:(OR (NEQ s29 1) (NEQ s73 1) (NEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 814 ms.
Product exploration explored 100000 steps with 50000 reset in 854 ms.
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 816 ms.
Product exploration explored 100000 steps with 50000 reset in 838 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Support contains 6 out of 200 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 61 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:24:49] [INFO ] Redundant transitions in 61 ms returned []
[2021-05-09 14:24:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:24:49] [INFO ] Computed 100 place invariants in 0 ms
[2021-05-09 14:24:50] [INFO ] Dead Transitions using invariants and state equation in 956 ms returned []
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2600/2600 transitions.
Product exploration explored 100000 steps with 50000 reset in 2562 ms.
Product exploration explored 100000 steps with 50000 reset in 2593 ms.
[2021-05-09 14:24:56] [INFO ] Flatten gal took : 104 ms
[2021-05-09 14:24:56] [INFO ] Flatten gal took : 102 ms
[2021-05-09 14:24:56] [INFO ] Time to serialize gal into /tmp/LTL461839153005993768.gal : 13 ms
[2021-05-09 14:24:56] [INFO ] Time to serialize properties into /tmp/LTL15297415039381312142.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/LTL461839153005993768.gal, -t, CGAL, -LTL, /tmp/LTL15297415039381312142.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/LTL461839153005993768.gal -t CGAL -LTL /tmp/LTL15297415039381312142.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((((flag_1_2==1)&&(flag_1_47==1))&&(p1_2==1))&&(flag_1_14==1))&&(flag_1_36==1))&&(p1_14==1))"))U(X(("(((flag_1_14==0)||(flag_1_36==0))||(p1_14==0))")U((G("(((flag_1_14==0)||(flag_1_36==0))||(p1_14==0))"))||("((((flag_1_2==0)||(flag_1_47==0))||(p1_2==0))&&(((flag_1_14==0)||(flag_1_36==0))||(p1_14==0)))"))))))
Formula 0 simplified : !(F"((((((flag_1_2==1)&&(flag_1_47==1))&&(p1_2==1))&&(flag_1_14==1))&&(flag_1_36==1))&&(p1_14==1))" U X("(((flag_1_14==0)||(flag_1_36==0))||(p1_14==0))" U ("((((flag_1_2==0)||(flag_1_47==0))||(p1_2==0))&&(((flag_1_14==0)||(flag_1_36==0))||(p1_14==0)))" | G"(((flag_1_14==0)||(flag_1_36==0))||(p1_14==0))")))
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831, t883, t935, t987, t1039, t1091, t1143, t1195, t1247, t1299, t1351, t1403, t1455, t1507, t1559, t1611, t1663, t1715, t1767, t1819, t1871, t1923, t1975, t2027, t2079, t2131, t2183, t2235, t2287, t2339, t2391, t2443, t2495, t2547, t2599, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2550/50/2600
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
496 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,5.34616,164372,1,0,5260,975787,5238,2603,35359,474934,5220
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Dekker-PT-050-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Dekker-PT-050-07 finished in 18623 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((X(G((X(p1)&&F(p2))))&&p0)))))], workingDir=/home/mcc/execution]
Support contains 56 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:02] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:25:02] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-09 14:25:02] [INFO ] Implicit Places using invariants in 298 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 309 ms to find 2 implicit places.
[2021-05-09 14:25:02] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:25:02] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:25:03] [INFO ] Dead Transitions using invariants and state equation in 906 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:25:03] [INFO ] Computed 100 place invariants in 0 ms
[2021-05-09 14:25:04] [INFO ] Dead Transitions using invariants and state equation in 864 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Dekker-PT-050-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s50 1) (EQ s52 1) (EQ s54 1) (EQ s56 1) (EQ s58 1) (EQ s60 1) (EQ s62 1) (EQ s64 1) (EQ s66 1) (EQ s68 1) (EQ s70 1) (EQ s72 1) (EQ s74 1) (EQ s76 1) (EQ s78 1) (EQ s80 1) (EQ s82 1) (EQ s84 1) (EQ s86 1) (EQ s88 1) (EQ s90 1) (EQ s92 1) (EQ s94 1) (EQ s96 1) (EQ s98 1) (EQ s110 1)), p2:(AND (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s50 1) (EQ s52 1) (EQ s54 1) (EQ s56 1) (EQ s58 1) (EQ s60 1) (EQ s62 1) (EQ s64 1) (EQ s66 1) (EQ s68 1) (EQ s70 1) (EQ s72 1) (EQ s74 1) (EQ s76 1) (EQ s78 1) (EQ s80 1) (EQ s82 1) (EQ s84 1) (EQ s86 1) (EQ s88 1) (EQ s90 1) (EQ s92 1) (EQ s94 1) (EQ s96 1) (EQ s98 1) (EQ s110 1)), p1:(OR (AND (EQ s25 1) (EQ s35 1) (EQ s124 1)) (AND (EQ s29 1) (EQ s45 1) (EQ s128 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-08 finished in 2332 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:25:04] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-09 14:25:04] [INFO ] Implicit Places using invariants in 330 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 341 ms to find 1 implicit places.
[2021-05-09 14:25:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2021-05-09 14:25:04] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-09 14:25:05] [INFO ] Dead Transitions using invariants and state equation in 828 ms returned []
Starting structural reductions, iteration 1 : 201/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2021-05-09 14:25:05] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-09 14:25:06] [INFO ] Dead Transitions using invariants and state equation in 936 ms returned []
Finished structural reductions, in 2 iterations. Remains : 201/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Dekker-PT-050-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT 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:(AND (EQ s77 1) (EQ s81 1) (EQ s181 1)), p0:(AND (EQ s76 1) (EQ s176 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]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-050-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-09 finished in 2212 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 78 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:06] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:25:06] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-09 14:25:07] [INFO ] Implicit Places using invariants in 372 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 376 ms to find 2 implicit places.
[2021-05-09 14:25:07] [INFO ] Redundant transitions in 62 ms returned []
[2021-05-09 14:25:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:25:07] [INFO ] Computed 100 place invariants in 6 ms
[2021-05-09 14:25:08] [INFO ] Dead Transitions using invariants and state equation in 842 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 65 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:08] [INFO ] Redundant transitions in 62 ms returned []
[2021-05-09 14:25:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:25:08] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:25:09] [INFO ] Dead Transitions using invariants and state equation in 843 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-050-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s15 1) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 994 reset in 1055 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA Dekker-PT-050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-11 finished in 3452 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(X(X(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 9 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:25:10] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-09 14:25:10] [INFO ] Implicit Places using invariants in 338 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 355 ms to find 2 implicit places.
[2021-05-09 14:25:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:25:10] [INFO ] Computed 100 place invariants in 0 ms
[2021-05-09 14:25:11] [INFO ] Dead Transitions using invariants and state equation in 840 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:11] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:25:11] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:25:12] [INFO ] Dead Transitions using invariants and state equation in 886 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (EQ s35 1) (EQ s85 1) (EQ s134 1)) (AND (EQ s71 1) (EQ s97 1) (EQ s170 1))), p1:(OR (NEQ s19 1) (NEQ s57 1) (NEQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1550 reset in 1075 ms.
Stack based approach found an accepted trace after 83 steps with 1 reset with depth 22 and stack size 22 in 1 ms.
FORMULA Dekker-PT-050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-12 finished in 3353 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 61 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:25:13] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-09 14:25:13] [INFO ] Implicit Places using invariants in 333 ms returned [102, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 343 ms to find 2 implicit places.
[2021-05-09 14:25:13] [INFO ] Redundant transitions in 61 ms returned []
[2021-05-09 14:25:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:25:13] [INFO ] Computed 100 place invariants in 1 ms
[2021-05-09 14:25:14] [INFO ] Dead Transitions using invariants and state equation in 841 ms returned []
Starting structural reductions, iteration 1 : 200/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 79 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:14] [INFO ] Redundant transitions in 62 ms returned []
[2021-05-09 14:25:14] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2021-05-09 14:25:14] [INFO ] Computed 100 place invariants in 0 ms
[2021-05-09 14:25:15] [INFO ] Dead Transitions using invariants and state equation in 833 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-050-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s41 1) (EQ s140 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 1080 ms.
Stack based approach found an accepted trace after 142 steps with 0 reset with depth 143 and stack size 141 in 2 ms.
FORMULA Dekker-PT-050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-14 finished in 3435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 61 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2021-05-09 14:25:16] [INFO ] Computed 102 place invariants in 3 ms
[2021-05-09 14:25:17] [INFO ] Implicit Places using invariants in 316 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 326 ms to find 1 implicit places.
[2021-05-09 14:25:17] [INFO ] Redundant transitions in 61 ms returned []
[2021-05-09 14:25:17] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2021-05-09 14:25:17] [INFO ] Computed 101 place invariants in 0 ms
[2021-05-09 14:25:18] [INFO ] Dead Transitions using invariants and state equation in 860 ms returned []
Starting structural reductions, iteration 1 : 201/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 65 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 14:25:18] [INFO ] Redundant transitions in 62 ms returned []
[2021-05-09 14:25:18] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2021-05-09 14:25:18] [INFO ] Computed 101 place invariants in 0 ms
[2021-05-09 14:25:19] [INFO ] Dead Transitions using invariants and state equation in 876 ms returned []
Finished structural reductions, in 2 iterations. Remains : 201/202 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s61 0) (EQ s65 0) (EQ s165 0) (AND (EQ s21 1) (EQ s83 1) (EQ s183 1)) (AND (NEQ s2 0) (NEQ s102 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 442 reset in 1065 ms.
Stack based approach found an accepted trace after 4927 steps with 21 reset with depth 76 and stack size 76 in 57 ms.
FORMULA Dekker-PT-050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-15 finished in 3535 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620570322660

--------------------
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-050"
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-050, 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-162038397700781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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