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.r140-tall-162089128200605.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 Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200605
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 360K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 257K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 100K 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 Peterson-PT-2-00
FORMULA_NAME Peterson-PT-2-01
FORMULA_NAME Peterson-PT-2-02
FORMULA_NAME Peterson-PT-2-03
FORMULA_NAME Peterson-PT-2-04
FORMULA_NAME Peterson-PT-2-05
FORMULA_NAME Peterson-PT-2-06
FORMULA_NAME Peterson-PT-2-07
FORMULA_NAME Peterson-PT-2-08
FORMULA_NAME Peterson-PT-2-09
FORMULA_NAME Peterson-PT-2-10
FORMULA_NAME Peterson-PT-2-11
FORMULA_NAME Peterson-PT-2-12
FORMULA_NAME Peterson-PT-2-13
FORMULA_NAME Peterson-PT-2-14
FORMULA_NAME Peterson-PT-2-15

=== Now, execution of the tool begins

BK_START 1621018867266

Running Version 0
[2021-05-14 19:01:24] [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-14 19:01:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:01:24] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-14 19:01:24] [INFO ] Transformed 102 places.
[2021-05-14 19:01:24] [INFO ] Transformed 126 transitions.
[2021-05-14 19:01:24] [INFO ] Found NUPN structural information;
[2021-05-14 19:01:24] [INFO ] Parsed PT model containing 102 places and 126 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 19:01:24] [INFO ] Initial state test concluded for 3 properties.
FORMULA Peterson-PT-2-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:01:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 19:01:24] [INFO ] Computed 11 place invariants in 7 ms
[2021-05-14 19:01:24] [INFO ] Implicit Places using invariants in 119 ms returned [85, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
[2021-05-14 19:01:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2021-05-14 19:01:24] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-14 19:01:24] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Starting structural reductions, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:01:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2021-05-14 19:01:24] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-14 19:01:24] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 2 iterations. Remains : 100/102 places, 126/126 transitions.
[2021-05-14 19:01:24] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-14 19:01:24] [INFO ] Flatten gal took : 32 ms
FORMULA Peterson-PT-2-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 19:01:24] [INFO ] Flatten gal took : 13 ms
[2021-05-14 19:01:24] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 21) seen :18
Running SMT prover for 3 properties.
[2021-05-14 19:01:25] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2021-05-14 19:01:25] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-14 19:01:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 19:01:25] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-14 19:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:01:25] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-14 19:01:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 19:01:25] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:01:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:01:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 19:01:25] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 8 ms returned sat
[2021-05-14 19:01:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:01:25] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-14 19:01:25] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:01:25] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 4 ms to minimize.
[2021-05-14 19:01:25] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2021-05-14 19:01:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2021-05-14 19:01:25] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2021-05-14 19:01:25] [INFO ] Deduced a trap composed of 42 places in 26 ms of which 1 ms to minimize.
[2021-05-14 19:01:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 251 ms
[2021-05-14 19:01:25] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 10 ms.
[2021-05-14 19:01:25] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:01:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-14 19:01:25] [INFO ] Added : 105 causal constraints over 21 iterations in 262 ms. Result :sat
[2021-05-14 19:01:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 19:01:25] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-14 19:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:01:26] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-14 19:01:26] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:01:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:01:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 19:01:26] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-14 19:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:01:26] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-14 19:01:26] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:01:26] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2021-05-14 19:01:26] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2021-05-14 19:01:26] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:01:26] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:01:26] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2021-05-14 19:01:26] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2021-05-14 19:01:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 184 ms
[2021-05-14 19:01:26] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 7 ms.
[2021-05-14 19:01:26] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:01:26] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:01:26] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2021-05-14 19:01:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 90 ms
[2021-05-14 19:01:26] [INFO ] Added : 79 causal constraints over 16 iterations in 220 ms. Result :sat
[2021-05-14 19:01:26] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 19:01:26] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-14 19:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:01:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-14 19:01:26] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:01:26] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2021-05-14 19:01:26] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-14 19:01:26] [INFO ] Implicit Places using invariants in 50 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
[2021-05-14 19:01:26] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:01:26] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:01:26] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:01:26] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:01:26] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:01:26] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s21 1) (EQ s22 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2674 reset in 222 ms.
Stack based approach found an accepted trace after 35 steps with 1 reset with depth 20 and stack size 20 in 1 ms.
FORMULA Peterson-PT-2-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-00 finished in 630 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&(p1 U p2)))||X(X(X(G(p3))))))], workingDir=/home/mcc/execution]
Support contains 36 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:01:27] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2021-05-14 19:01:27] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-14 19:01:27] [INFO ] Implicit Places using invariants in 43 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
[2021-05-14 19:01:27] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:01:27] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 19:01:27] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:01:27] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:01:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:01:27] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 393 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : Peterson-PT-2-01 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=8 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=8 dest: 3}]], initial=6, aps=[p2:(OR (AND (EQ s46 1) (EQ s60 1)) (AND (EQ s46 1) (EQ s58 1)) (AND (EQ s46 1) (EQ s59 1)) (AND (EQ s48 1) (EQ s50 1)) (AND (EQ s48 1) (EQ s51 1)) (AND (EQ s47 1) (EQ s54 1)) (AND (EQ s47 1) (EQ s55 1)) (AND (EQ s47 1) (EQ s56 1)) (AND (EQ s47 1) (EQ s49 1)) (AND (EQ s46 1) (EQ s53 1)) (AND (EQ s45 1) (EQ s48 1)) (AND (EQ s48 1) (EQ s52 1))), p1:(OR (AND (EQ s42 1) (EQ s60 1)) (AND (EQ s44 1) (EQ s52 1)) (AND (EQ s42 1) (EQ s58 1)) (AND (EQ s42 1) (EQ s59 1)) (AND (EQ s41 1) (EQ s56 1)) (AND (EQ s41 1) (EQ s55 1)) (AND (EQ s41 1) (EQ s54 1)) (AND (EQ s42 1) (EQ s53 1)) (AND (EQ s44 1) (EQ s45 1)) (AND (EQ s44 1) (EQ s50 1)) (AND (EQ s41 1) (EQ s49 1)) (AND (EQ s44 1) (EQ s51 1))), p0:(OR (EQ s80 1) (EQ s83 1) (EQ s69 1) (EQ s73 1) (EQ s72 1) (EQ s62 1)), p3:(OR (EQ s81 1) (EQ s64 1) (EQ s82 1) (EQ s84 1) (EQ s71 1) (EQ s70 1) (EQ s75 1) (EQ s74 1) (EQ s77 1) (EQ s76 1) (EQ s63 1) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], 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 30 reset in 232 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 0 ms.
FORMULA Peterson-PT-2-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-01 finished in 823 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||G(p1)) U (G(F(p3))||p2)))], workingDir=/home/mcc/execution]
Support contains 21 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 100 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 68 transition count 94
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 64 place count 68 transition count 80
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 92 place count 54 transition count 80
Applied a total of 92 rules in 21 ms. Remains 54 /100 variables (removed 46) and now considering 80/126 (removed 46) transitions.
[2021-05-14 19:01:28] [INFO ] Flow matrix only has 74 transitions (discarded 6 similar events)
// Phase 1: matrix 74 rows 54 cols
[2021-05-14 19:01:28] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-14 19:01:28] [INFO ] Implicit Places using invariants in 35 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
[2021-05-14 19:01:28] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:01:28] [INFO ] Flow matrix only has 74 transitions (discarded 6 similar events)
// Phase 1: matrix 74 rows 53 cols
[2021-05-14 19:01:28] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:01:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 53/100 places, 80/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2021-05-14 19:01:28] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:01:28] [INFO ] Flow matrix only has 74 transitions (discarded 6 similar events)
// Phase 1: matrix 74 rows 53 cols
[2021-05-14 19:01:28] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:01:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 53/100 places, 80/126 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Peterson-PT-2-04 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3) p0) (AND (NOT p2) (NOT p3) p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p3) p0) (AND (NOT p2) (NOT p3) p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (EQ s40 1) (EQ s50 1)) (AND (EQ s40 1) (EQ s51 1)) (AND (EQ s38 1) (EQ s50 1)) (AND (EQ s38 1) (EQ s51 1)) (AND (EQ s39 1) (EQ s47 1)) (AND (EQ s42 1) (EQ s48 1)) (AND (EQ s40 1) (EQ s48 1)) (AND (EQ s42 1) (EQ s51 1)) (AND (EQ s39 1) (EQ s46 1)) (AND (EQ s42 1) (EQ s50 1)) (AND (EQ s39 1) (EQ s49 1)) (AND (EQ s41 1) (EQ s47 1)) (AND (EQ s41 1) (EQ s46 1)) (AND (EQ s41 1) (EQ s49 1)) (AND (EQ s43 1) (EQ s49 1)) (AND (EQ s43 1) (EQ s47 1)) (AND (EQ s43 1) (EQ s46 1)) (AND (EQ s38 1) (EQ s48 1))), p0:(AND (EQ s17 0) (EQ s18 0) (EQ s20 0)), p1:(AND (OR (NEQ s40 1) (NEQ s50 1)) (OR (NEQ s40 1) (NEQ s51 1)) (OR (NEQ s38 1) (NEQ s50 1)) (OR (NEQ s38 1) (NEQ s51 1)) (OR (NEQ s39 1) (NEQ s47 1)) (OR (NEQ s42 1) (NEQ s48 1)) (OR (NEQ s40 1) (NEQ s48 1)) (OR (NEQ s42 1) (NEQ s51 1)) (OR (NEQ s39 1) (NEQ s46 1)) (OR (NEQ s42 1) (NEQ s50 1)) (OR (NEQ s39 1) (NEQ s49 1)) (OR (NEQ s41 1) (NEQ s47 1)) (OR (NEQ s41 1) (NEQ s46 1)) (OR (NEQ s41 1) (NEQ s49 1)) (OR (NEQ s43 1) (NEQ s49 1)) (OR (NEQ s43 1) (NEQ s47 1)) (OR (NEQ s43 1) (NEQ s46 1)) (OR (NEQ s38 1) (NEQ s48 1))), p3:(OR (EQ s12 1) (EQ s14 1) (EQ s8 1) (EQ s9 1) (EQ s10 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 466 ms.
Product exploration explored 100000 steps with 50000 reset in 485 ms.
Knowledge obtained : [(NOT p2), p0, p1, (NOT p3)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 435 ms.
Product exploration explored 100000 steps with 50000 reset in 441 ms.
[2021-05-14 19:01:30] [INFO ] Flatten gal took : 8 ms
[2021-05-14 19:01:30] [INFO ] Flatten gal took : 6 ms
[2021-05-14 19:01:30] [INFO ] Time to serialize gal into /tmp/LTL18351300959283331330.gal : 3 ms
[2021-05-14 19:01:30] [INFO ] Time to serialize properties into /tmp/LTL2459913537517285281.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/LTL18351300959283331330.gal, -t, CGAL, -LTL, /tmp/LTL2459913537517285281.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/LTL18351300959283331330.gal -t CGAL -LTL /tmp/LTL2459913537517285281.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((G("(((((((((((((((((((Turn_0_1==0)||(AskForSection_0_0==0))&&((Turn_0_1==0)||(AskForSection_1_0==0)))&&((Turn_0_0==0)||(AskForSection_0_0==0)))&&((Turn_0_0==0)||(AskForSection_1_0==0)))&&((Turn_1_2==0)||(AskForSection_2_1==0)))&&((Turn_0_2==0)||(AskForSection_2_0==0)))&&((Turn_0_1==0)||(AskForSection_2_0==0)))&&((Turn_0_2==0)||(AskForSection_1_0==0)))&&((Turn_1_2==0)||(AskForSection_1_1==0)))&&((Turn_0_2==0)||(AskForSection_0_0==0)))&&((Turn_1_2==0)||(AskForSection_0_1==0)))&&((Turn_1_0==0)||(AskForSection_2_1==0)))&&((Turn_1_0==0)||(AskForSection_1_1==0)))&&((Turn_1_0==0)||(AskForSection_0_1==0)))&&((Turn_1_1==0)||(AskForSection_0_1==0)))&&((Turn_1_1==0)||(AskForSection_2_1==0)))&&((Turn_1_1==0)||(AskForSection_1_1==0)))&&((Turn_0_0==0)||(AskForSection_2_0==0)))"))||("(((EndTurn_1_1==0)&&(EndTurn_0_1==0))&&(EndTurn_2_1==0))"))U(((((((((((((((((((G(F("((((((IsEndLoop_0_1_2==1)||(IsEndLoop_2_1_2==1))||(IsEndLoop_0_0_2==1))||(IsEndLoop_2_0_2==1))||(IsEndLoop_1_0_2==1))||(IsEndLoop_1_1_2==1))")))||("((Turn_0_1==1)&&(AskForSection_0_0==1))"))||("((Turn_0_1==1)&&(AskForSection_1_0==1))"))||("((Turn_0_0==1)&&(AskForSection_0_0==1))"))||("((Turn_0_0==1)&&(AskForSection_1_0==1))"))||("((Turn_1_2==1)&&(AskForSection_2_1==1))"))||("((Turn_0_2==1)&&(AskForSection_2_0==1))"))||("((Turn_0_1==1)&&(AskForSection_2_0==1))"))||("((Turn_0_2==1)&&(AskForSection_1_0==1))"))||("((Turn_1_2==1)&&(AskForSection_1_1==1))"))||("((Turn_0_2==1)&&(AskForSection_0_0==1))"))||("((Turn_1_2==1)&&(AskForSection_0_1==1))"))||("((Turn_1_0==1)&&(AskForSection_2_1==1))"))||("((Turn_1_0==1)&&(AskForSection_1_1==1))"))||("((Turn_1_0==1)&&(AskForSection_0_1==1))"))||("((Turn_1_1==1)&&(AskForSection_0_1==1))"))||("((Turn_1_1==1)&&(AskForSection_2_1==1))"))||("((Turn_1_1==1)&&(AskForSection_1_1==1))"))||("((Turn_0_0==1)&&(AskForSection_2_0==1))"))))
Formula 0 simplified : !(("(((EndTurn_1_1==0)&&(EndTurn_0_1==0))&&(EndTurn_2_1==0))" | G"(((((((((((((((((((Turn_0_1==0)||(AskForSection_0_0==0))&&((Turn_0_1==0)||(AskForSection_1_0==0)))&&((Turn_0_0==0)||(AskForSection_0_0==0)))&&((Turn_0_0==0)||(AskForSection_1_0==0)))&&((Turn_1_2==0)||(AskForSection_2_1==0)))&&((Turn_0_2==0)||(AskForSection_2_0==0)))&&((Turn_0_1==0)||(AskForSection_2_0==0)))&&((Turn_0_2==0)||(AskForSection_1_0==0)))&&((Turn_1_2==0)||(AskForSection_1_1==0)))&&((Turn_0_2==0)||(AskForSection_0_0==0)))&&((Turn_1_2==0)||(AskForSection_0_1==0)))&&((Turn_1_0==0)||(AskForSection_2_1==0)))&&((Turn_1_0==0)||(AskForSection_1_1==0)))&&((Turn_1_0==0)||(AskForSection_0_1==0)))&&((Turn_1_1==0)||(AskForSection_0_1==0)))&&((Turn_1_1==0)||(AskForSection_2_1==0)))&&((Turn_1_1==0)||(AskForSection_1_1==0)))&&((Turn_0_0==0)||(AskForSection_2_0==0)))") U ("((Turn_0_0==1)&&(AskForSection_0_0==1))" | "((Turn_0_0==1)&&(AskForSection_1_0==1))" | "((Turn_0_0==1)&&(AskForSection_2_0==1))" | "((Turn_0_1==1)&&(AskForSection_0_0==1))" | "((Turn_0_1==1)&&(AskForSection_1_0==1))" | "((Turn_0_1==1)&&(AskForSection_2_0==1))" | "((Turn_0_2==1)&&(AskForSection_0_0==1))" | "((Turn_0_2==1)&&(AskForSection_1_0==1))" | "((Turn_0_2==1)&&(AskForSection_2_0==1))" | "((Turn_1_0==1)&&(AskForSection_0_1==1))" | "((Turn_1_0==1)&&(AskForSection_1_1==1))" | "((Turn_1_0==1)&&(AskForSection_2_1==1))" | "((Turn_1_1==1)&&(AskForSection_0_1==1))" | "((Turn_1_1==1)&&(AskForSection_1_1==1))" | "((Turn_1_1==1)&&(AskForSection_2_1==1))" | "((Turn_1_2==1)&&(AskForSection_0_1==1))" | "((Turn_1_2==1)&&(AskForSection_1_1==1))" | "((Turn_1_2==1)&&(AskForSection_2_1==1))" | GF"((((((IsEndLoop_0_1_2==1)||(IsEndLoop_2_1_2==1))||(IsEndLoop_0_0_2==1))||(IsEndLoop_2_0_2==1))||(IsEndLoop_1_0_2==1))||(IsEndLoop_1_1_2==1))"))
Detected timeout of ITS tools.
[2021-05-14 19:01:45] [INFO ] Flatten gal took : 14 ms
[2021-05-14 19:01:45] [INFO ] Applying decomposition
[2021-05-14 19:01:45] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14726473971543510867.txt, -o, /tmp/graph14726473971543510867.bin, -w, /tmp/graph14726473971543510867.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14726473971543510867.bin, -l, -1, -v, -w, /tmp/graph14726473971543510867.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:01:45] [INFO ] Decomposing Gal with order
[2021-05-14 19:01:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:01:45] [INFO ] Removed a total of 49 redundant transitions.
[2021-05-14 19:01:45] [INFO ] Flatten gal took : 81 ms
[2021-05-14 19:01:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-14 19:01:45] [INFO ] Time to serialize gal into /tmp/LTL4563935666833520046.gal : 25 ms
[2021-05-14 19:01:45] [INFO ] Time to serialize properties into /tmp/LTL16956417288688445164.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/LTL4563935666833520046.gal, -t, CGAL, -LTL, /tmp/LTL16956417288688445164.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4563935666833520046.gal -t CGAL -LTL /tmp/LTL16956417288688445164.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((G("(((((((((((((((((((i1.u9.Turn_0_1==0)||(i2.u6.AskForSection_0_0==0))&&((i1.u9.Turn_0_1==0)||(i1.u9.AskForSection_1_0==0)))&&((i2.u6.Turn_0_0==0)||(i2.u6.AskForSection_0_0==0)))&&((i2.u6.Turn_0_0==0)||(i1.u9.AskForSection_1_0==0)))&&((i5.u11.Turn_1_2==0)||(i5.u11.AskForSection_2_1==0)))&&((i0.u8.Turn_0_2==0)||(i0.u8.AskForSection_2_0==0)))&&((i1.u9.Turn_0_1==0)||(i0.u8.AskForSection_2_0==0)))&&((i0.u8.Turn_0_2==0)||(i1.u9.AskForSection_1_0==0)))&&((i5.u11.Turn_1_2==0)||(i6.u15.AskForSection_1_1==0)))&&((i0.u8.Turn_0_2==0)||(i2.u6.AskForSection_0_0==0)))&&((i5.u11.Turn_1_2==0)||(i4.u10.AskForSection_0_1==0)))&&((i4.u10.Turn_1_0==0)||(i5.u11.AskForSection_2_1==0)))&&((i4.u10.Turn_1_0==0)||(i6.u15.AskForSection_1_1==0)))&&((i4.u10.Turn_1_0==0)||(i4.u10.AskForSection_0_1==0)))&&((i6.u15.Turn_1_1==0)||(i4.u10.AskForSection_0_1==0)))&&((i6.u15.Turn_1_1==0)||(i5.u11.AskForSection_2_1==0)))&&((i6.u15.Turn_1_1==0)||(i6.u15.AskForSection_1_1==0)))&&((i2.u6.Turn_0_0==0)||(i0.u8.AskForSection_2_0==0)))"))||("(((i6.u4.EndTurn_1_1==0)&&(i4.u5.EndTurn_0_1==0))&&(i3.u7.EndTurn_2_1==0))"))U(((((((((((((((((((G(F("((((((i4.u5.IsEndLoop_0_1_2==1)||(i3.u0.IsEndLoop_2_1_2==1))||(i2.u3.IsEndLoop_0_0_2==1))||(i0.u1.IsEndLoop_2_0_2==1))||(i1.u2.IsEndLoop_1_0_2==1))||(i6.u4.IsEndLoop_1_1_2==1))")))||("((i1.u9.Turn_0_1==1)&&(i2.u6.AskForSection_0_0==1))"))||("((i1.u9.Turn_0_1==1)&&(i1.u9.AskForSection_1_0==1))"))||("((i2.u6.Turn_0_0==1)&&(i2.u6.AskForSection_0_0==1))"))||("((i2.u6.Turn_0_0==1)&&(i1.u9.AskForSection_1_0==1))"))||("((i5.u11.Turn_1_2==1)&&(i5.u11.AskForSection_2_1==1))"))||("((i0.u8.Turn_0_2==1)&&(i0.u8.AskForSection_2_0==1))"))||("((i1.u9.Turn_0_1==1)&&(i0.u8.AskForSection_2_0==1))"))||("((i0.u8.Turn_0_2==1)&&(i1.u9.AskForSection_1_0==1))"))||("((i5.u11.Turn_1_2==1)&&(i6.u15.AskForSection_1_1==1))"))||("((i0.u8.Turn_0_2==1)&&(i2.u6.AskForSection_0_0==1))"))||("((i5.u11.Turn_1_2==1)&&(i4.u10.AskForSection_0_1==1))"))||("((i4.u10.Turn_1_0==1)&&(i5.u11.AskForSection_2_1==1))"))||("((i4.u10.Turn_1_0==1)&&(i6.u15.AskForSection_1_1==1))"))||("((i4.u10.Turn_1_0==1)&&(i4.u10.AskForSection_0_1==1))"))||("((i6.u15.Turn_1_1==1)&&(i4.u10.AskForSection_0_1==1))"))||("((i6.u15.Turn_1_1==1)&&(i5.u11.AskForSection_2_1==1))"))||("((i6.u15.Turn_1_1==1)&&(i6.u15.AskForSection_1_1==1))"))||("((i2.u6.Turn_0_0==1)&&(i0.u8.AskForSection_2_0==1))"))))
Formula 0 simplified : !(("(((i6.u4.EndTurn_1_1==0)&&(i4.u5.EndTurn_0_1==0))&&(i3.u7.EndTurn_2_1==0))" | G"(((((((((((((((((((i1.u9.Turn_0_1==0)||(i2.u6.AskForSection_0_0==0))&&((i1.u9.Turn_0_1==0)||(i1.u9.AskForSection_1_0==0)))&&((i2.u6.Turn_0_0==0)||(i2.u6.AskForSection_0_0==0)))&&((i2.u6.Turn_0_0==0)||(i1.u9.AskForSection_1_0==0)))&&((i5.u11.Turn_1_2==0)||(i5.u11.AskForSection_2_1==0)))&&((i0.u8.Turn_0_2==0)||(i0.u8.AskForSection_2_0==0)))&&((i1.u9.Turn_0_1==0)||(i0.u8.AskForSection_2_0==0)))&&((i0.u8.Turn_0_2==0)||(i1.u9.AskForSection_1_0==0)))&&((i5.u11.Turn_1_2==0)||(i6.u15.AskForSection_1_1==0)))&&((i0.u8.Turn_0_2==0)||(i2.u6.AskForSection_0_0==0)))&&((i5.u11.Turn_1_2==0)||(i4.u10.AskForSection_0_1==0)))&&((i4.u10.Turn_1_0==0)||(i5.u11.AskForSection_2_1==0)))&&((i4.u10.Turn_1_0==0)||(i6.u15.AskForSection_1_1==0)))&&((i4.u10.Turn_1_0==0)||(i4.u10.AskForSection_0_1==0)))&&((i6.u15.Turn_1_1==0)||(i4.u10.AskForSection_0_1==0)))&&((i6.u15.Turn_1_1==0)||(i5.u11.AskForSection_2_1==0)))&&((i6.u15.Turn_1_1==0)||(i6.u15.AskForSection_1_1==0)))&&((i2.u6.Turn_0_0==0)||(i0.u8.AskForSection_2_0==0)))") U ("((i0.u8.Turn_0_2==1)&&(i0.u8.AskForSection_2_0==1))" | "((i0.u8.Turn_0_2==1)&&(i1.u9.AskForSection_1_0==1))" | "((i0.u8.Turn_0_2==1)&&(i2.u6.AskForSection_0_0==1))" | "((i1.u9.Turn_0_1==1)&&(i0.u8.AskForSection_2_0==1))" | "((i1.u9.Turn_0_1==1)&&(i1.u9.AskForSection_1_0==1))" | "((i1.u9.Turn_0_1==1)&&(i2.u6.AskForSection_0_0==1))" | "((i2.u6.Turn_0_0==1)&&(i0.u8.AskForSection_2_0==1))" | "((i2.u6.Turn_0_0==1)&&(i1.u9.AskForSection_1_0==1))" | "((i2.u6.Turn_0_0==1)&&(i2.u6.AskForSection_0_0==1))" | "((i4.u10.Turn_1_0==1)&&(i4.u10.AskForSection_0_1==1))" | "((i4.u10.Turn_1_0==1)&&(i5.u11.AskForSection_2_1==1))" | "((i4.u10.Turn_1_0==1)&&(i6.u15.AskForSection_1_1==1))" | "((i5.u11.Turn_1_2==1)&&(i4.u10.AskForSection_0_1==1))" | "((i5.u11.Turn_1_2==1)&&(i5.u11.AskForSection_2_1==1))" | "((i5.u11.Turn_1_2==1)&&(i6.u15.AskForSection_1_1==1))" | "((i6.u15.Turn_1_1==1)&&(i4.u10.AskForSection_0_1==1))" | "((i6.u15.Turn_1_1==1)&&(i5.u11.AskForSection_2_1==1))" | "((i6.u15.Turn_1_1==1)&&(i6.u15.AskForSection_1_1==1))" | GF"((((((i4.u5.IsEndLoop_0_1_2==1)||(i3.u0.IsEndLoop_2_1_2==1))||(i2.u3.IsEndLoop_0_0_2==1))||(i0.u1.IsEndLoop_2_0_2==1))||(i1.u2.IsEndLoop_1_0_2==1))||(i6.u4.IsEndLoop_1_1_2==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2840149831682963969
[2021-05-14 19:02:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2840149831682963969
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2840149831682963969]
Compilation finished in 445 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2840149831682963969]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (([]((LTLAPp0==true))||(LTLAPp1==true)) U ([](<>((LTLAPp3==true)))||(LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2840149831682963969]
LTSmin run took 212 ms.
FORMULA Peterson-PT-2-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-2-04 finished in 40273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 15 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:02:08] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2021-05-14 19:02:08] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-14 19:02:08] [INFO ] Implicit Places using invariants in 72 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
[2021-05-14 19:02:08] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:02:08] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 19:02:08] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Starting structural reductions, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:02:08] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:02:08] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 19:02:08] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s17 1) (EQ s19 1) (EQ s20 1) (AND (EQ s66 1) (EQ s86 1)) (AND (EQ s61 1) (EQ s87 1)) (AND (EQ s65 1) (EQ s88 1)) (AND (EQ s67 1) (EQ s89 1)) (AND (EQ s66 1) (EQ s79 1)) (AND (EQ s68 1) (EQ s87 1)) (AND (EQ s65 1) (EQ s79 1)) (AND (EQ s61 1) (EQ s89 1)) (AND (EQ s57 1) (EQ s86 1)) (AND (EQ s57 1) (EQ s88 1)) (AND (EQ s68 1) (EQ s85 1)) (AND (EQ s67 1) (EQ s85 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-05 finished in 422 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 18 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 100 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 94 transition count 120
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 12 place count 94 transition count 106
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 40 place count 80 transition count 106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 76 transition count 102
Applied a total of 48 rules in 10 ms. Remains 76 /100 variables (removed 24) and now considering 102/126 (removed 24) transitions.
[2021-05-14 19:02:08] [INFO ] Flow matrix only has 96 transitions (discarded 6 similar events)
// Phase 1: matrix 96 rows 76 cols
[2021-05-14 19:02:08] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-14 19:02:08] [INFO ] Implicit Places using invariants in 85 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
[2021-05-14 19:02:08] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 19:02:08] [INFO ] Flow matrix only has 96 transitions (discarded 6 similar events)
// Phase 1: matrix 96 rows 75 cols
[2021-05-14 19:02:08] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 19:02:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 75/100 places, 102/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2021-05-14 19:02:08] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 19:02:08] [INFO ] Flow matrix only has 96 transitions (discarded 6 similar events)
// Phase 1: matrix 96 rows 75 cols
[2021-05-14 19:02:08] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:02:09] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 2 iterations. Remains : 75/100 places, 102/126 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-2-06 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s63 1) (EQ s46 1) (EQ s64 1) (EQ s66 1) (EQ s53 1) (EQ s52 1) (EQ s57 1) (EQ s56 1) (EQ s59 1) (EQ s58 1) (EQ s45 1) (EQ s60 1)), p1:(OR (EQ s62 1) (EQ s65 1) (EQ s51 1) (EQ s55 1) (EQ s54 1) (EQ s44 1))], nbAcceptance=2, 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 259 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Peterson-PT-2-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-06 finished in 599 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 30 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 124
Reduce places removed 2 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 20 rules applied. Total rules applied 22 place count 98 transition count 106
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 40 place count 80 transition count 106
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 80 transition count 100
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 74 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 70 transition count 96
Applied a total of 60 rules in 9 ms. Remains 70 /100 variables (removed 30) and now considering 96/126 (removed 30) transitions.
[2021-05-14 19:02:09] [INFO ] Flow matrix only has 90 transitions (discarded 6 similar events)
// Phase 1: matrix 90 rows 70 cols
[2021-05-14 19:02:09] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-14 19:02:09] [INFO ] Implicit Places using invariants in 24 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
[2021-05-14 19:02:09] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:02:09] [INFO ] Flow matrix only has 90 transitions (discarded 6 similar events)
// Phase 1: matrix 90 rows 69 cols
[2021-05-14 19:02:09] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:02:09] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Starting structural reductions, iteration 1 : 69/100 places, 96/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2021-05-14 19:02:09] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:02:09] [INFO ] Flow matrix only has 90 transitions (discarded 6 similar events)
// Phase 1: matrix 90 rows 69 cols
[2021-05-14 19:02:09] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:02:09] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 69/100 places, 96/126 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s56 1) (EQ s62 1)) (AND (EQ s51 1) (EQ s60 1)) (AND (EQ s55 1) (EQ s61 1)) (AND (EQ s59 1) (EQ s65 1)) (AND (EQ s57 1) (EQ s64 1)) (AND (EQ s58 1) (EQ s63 1))), p1:(OR (EQ s26 1) (EQ s27 1) (EQ s28 1) (EQ s29 1) (EQ s31 1) (EQ s30 1) (EQ s33 1) (EQ s32 1) (EQ s34 1) (EQ s37 1) (EQ s17 1) (EQ s19 1) (EQ s20 1) (EQ s21 1) (EQ s22 1) (EQ s23 1) (EQ s24 1) (EQ s25 1) (AND (EQ s56 1) (EQ s62 1)) (AND (EQ s51 1) (EQ s60 1)) (AND (EQ s55 1) (EQ s61 1)) (AND (EQ s59 1) (EQ s65 1)) (AND (EQ s57 1) (EQ s64 1)) (AND (EQ s58 1) (EQ s63 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5 reset in 182 ms.
Stack based approach found an accepted trace after 89 steps with 3 reset with depth 80 and stack size 78 in 0 ms.
FORMULA Peterson-PT-2-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-07 finished in 459 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&X(X(X(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:02:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2021-05-14 19:02:09] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-14 19:02:09] [INFO ] Implicit Places using invariants in 38 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
[2021-05-14 19:02:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:02:09] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-14 19:02:09] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:02:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:02:09] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-14 19:02:09] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (NEQ s66 1) (NEQ s86 1)), p1:(EQ s14 1)], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA Peterson-PT-2-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-10 finished in 555 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 100 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 68 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 67 transition count 93
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 66 place count 67 transition count 75
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 102 place count 49 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 112 place count 44 transition count 70
Applied a total of 112 rules in 15 ms. Remains 44 /100 variables (removed 56) and now considering 70/126 (removed 56) transitions.
[2021-05-14 19:02:10] [INFO ] Flow matrix only has 64 transitions (discarded 6 similar events)
// Phase 1: matrix 64 rows 44 cols
[2021-05-14 19:02:10] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-14 19:02:10] [INFO ] Implicit Places using invariants in 57 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
[2021-05-14 19:02:10] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:02:10] [INFO ] Flow matrix only has 64 transitions (discarded 6 similar events)
// Phase 1: matrix 64 rows 43 cols
[2021-05-14 19:02:10] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:02:10] [INFO ] Dead Transitions using invariants and state equation in 241 ms returned []
Starting structural reductions, iteration 1 : 43/100 places, 70/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2021-05-14 19:02:10] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:02:10] [INFO ] Flow matrix only has 64 transitions (discarded 6 similar events)
// Phase 1: matrix 64 rows 43 cols
[2021-05-14 19:02:10] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 19:02:10] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 43/100 places, 70/126 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s19 1), p0:(AND (EQ s19 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Peterson-PT-2-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-11 finished in 569 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 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 100 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 64 transition count 90
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 72 place count 64 transition count 73
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 47 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 116 place count 42 transition count 68
Applied a total of 116 rules in 6 ms. Remains 42 /100 variables (removed 58) and now considering 68/126 (removed 58) transitions.
[2021-05-14 19:02:10] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 42 cols
[2021-05-14 19:02:10] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-14 19:02:10] [INFO ] Implicit Places using invariants in 58 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
[2021-05-14 19:02:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-14 19:02:11] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 41 cols
[2021-05-14 19:02:11] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 19:02:11] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Starting structural reductions, iteration 1 : 41/100 places, 68/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2021-05-14 19:02:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-14 19:02:11] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 41 cols
[2021-05-14 19:02:11] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 19:02:11] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 41/100 places, 68/126 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-2-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s11 1) (OR (NEQ s28 1) (NEQ s35 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 131 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA Peterson-PT-2-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-13 finished in 426 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&(p1 U X(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:02:11] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2021-05-14 19:02:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-14 19:02:11] [INFO ] Implicit Places using invariants in 37 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
[2021-05-14 19:02:11] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:02:11] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-14 19:02:11] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Starting structural reductions, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2021-05-14 19:02:11] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2021-05-14 19:02:11] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 19:02:11] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s62 1) (AND (EQ s44 1) (EQ s51 1))), p1:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-15 finished in 300 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621018950239

--------------------
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="Peterson-PT-2"
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 Peterson-PT-2, 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 r140-tall-162089128200605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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