Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258000706.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000706
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 98K Apr 27 15:14 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 1590022858648

[2020-05-21 01:01:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 01:01:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:01:01] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2020-05-21 01:01:01] [INFO ] Transformed 102 places.
[2020-05-21 01:01:01] [INFO ] Transformed 126 transitions.
[2020-05-21 01:01:01] [INFO ] Parsed PT model containing 102 places and 126 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 214 ms. (steps per millisecond=467 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0]
[2020-05-21 01:01:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-05-21 01:01:02] [INFO ] Computed 11 place invariants in 14 ms
[2020-05-21 01:01:02] [INFO ] [Real]Absence check using 8 positive place invariants in 30 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:02] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2020-05-21 01:01:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-05-21 01:01:02] [INFO ] [Real]Added 26 Read/Feed constraints in 10 ms returned sat
[2020-05-21 01:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:02] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2020-05-21 01:01:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:02] [INFO ] Deduced a trap composed of 29 places in 65 ms
[2020-05-21 01:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2020-05-21 01:01:02] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 12 ms.
[2020-05-21 01:01:03] [INFO ] Added : 117 causal constraints over 24 iterations in 443 ms. Result :sat
[2020-05-21 01:01:03] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:03] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Real]Added 26 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 11 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:03] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2020-05-21 01:01:03] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:03] [INFO ] Deduced a trap composed of 8 places in 50 ms
[2020-05-21 01:01:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2020-05-21 01:01:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 17 ms.
[2020-05-21 01:01:03] [INFO ] Added : 116 causal constraints over 24 iterations in 332 ms. Result :sat
[2020-05-21 01:01:03] [INFO ] Deduced a trap composed of 29 places in 51 ms
[2020-05-21 01:01:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-05-21 01:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:04] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:04] [INFO ] Deduced a trap composed of 29 places in 29 ms
[2020-05-21 01:01:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2020-05-21 01:01:04] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 22 ms.
[2020-05-21 01:01:04] [INFO ] Added : 110 causal constraints over 23 iterations in 332 ms. Result :sat
[2020-05-21 01:01:04] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-05-21 01:01:04] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2020-05-21 01:01:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:04] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:04] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2020-05-21 01:01:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:05] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-05-21 01:01:05] [INFO ] Added : 105 causal constraints over 21 iterations in 211 ms. Result :sat
[2020-05-21 01:01:05] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2020-05-21 01:01:05] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2020-05-21 01:01:05] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2020-05-21 01:01:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2020-05-21 01:01:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:05] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:05] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:05] [INFO ] Deduced a trap composed of 29 places in 37 ms
[2020-05-21 01:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2020-05-21 01:01:05] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-05-21 01:01:05] [INFO ] Added : 110 causal constraints over 23 iterations in 267 ms. Result :sat
[2020-05-21 01:01:05] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-05-21 01:01:05] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2020-05-21 01:01:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2020-05-21 01:01:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-21 01:01:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:06] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-05-21 01:01:06] [INFO ] Added : 117 causal constraints over 24 iterations in 234 ms. Result :sat
[2020-05-21 01:01:06] [INFO ] Deduced a trap composed of 11 places in 86 ms
[2020-05-21 01:01:06] [INFO ] Deduced a trap composed of 29 places in 43 ms
[2020-05-21 01:01:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:06] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-21 01:01:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:06] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-05-21 01:01:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:06] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 16 ms.
[2020-05-21 01:01:07] [INFO ] Added : 117 causal constraints over 24 iterations in 257 ms. Result :sat
[2020-05-21 01:01:07] [INFO ] Deduced a trap composed of 11 places in 51 ms
[2020-05-21 01:01:07] [INFO ] Deduced a trap composed of 29 places in 50 ms
[2020-05-21 01:01:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2020-05-21 01:01:07] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-21 01:01:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:07] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-05-21 01:01:07] [INFO ] [Real]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:01:07] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-05-21 01:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2020-05-21 01:01:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 33 ms returned sat
[2020-05-21 01:01:07] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:07] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2020-05-21 01:01:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:07] [INFO ] Deduced a trap composed of 8 places in 68 ms
[2020-05-21 01:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2020-05-21 01:01:07] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 13 ms.
[2020-05-21 01:01:08] [INFO ] Added : 114 causal constraints over 23 iterations in 392 ms. Result :sat
[2020-05-21 01:01:08] [INFO ] Deduced a trap composed of 15 places in 90 ms
[2020-05-21 01:01:08] [INFO ] Deduced a trap composed of 8 places in 40 ms
[2020-05-21 01:01:08] [INFO ] Deduced a trap composed of 15 places in 35 ms
[2020-05-21 01:01:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 216 ms
[2020-05-21 01:01:08] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:01:08] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:08] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-05-21 01:01:08] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-21 01:01:08] [INFO ] Deduced a trap composed of 12 places in 236 ms
[2020-05-21 01:01:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2020-05-21 01:01:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:01:08] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:08] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-05-21 01:01:08] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-05-21 01:01:08] [INFO ] Deduced a trap composed of 12 places in 100 ms
[2020-05-21 01:01:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2020-05-21 01:01:08] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-05-21 01:01:09] [INFO ] Added : 117 causal constraints over 24 iterations in 280 ms. Result :sat
[2020-05-21 01:01:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:09] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:09] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:09] [INFO ] Deduced a trap composed of 22 places in 31 ms
[2020-05-21 01:01:09] [INFO ] Deduced a trap composed of 22 places in 31 ms
[2020-05-21 01:01:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2020-05-21 01:01:09] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-05-21 01:01:09] [INFO ] Added : 115 causal constraints over 24 iterations in 252 ms. Result :sat
[2020-05-21 01:01:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-21 01:01:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:09] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-21 01:01:09] [INFO ] Deduced a trap composed of 11 places in 43 ms
[2020-05-21 01:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2020-05-21 01:01:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:09] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-05-21 01:01:09] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:09] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2020-05-21 01:01:09] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-05-21 01:01:10] [INFO ] Deduced a trap composed of 8 places in 61 ms
[2020-05-21 01:01:10] [INFO ] Deduced a trap composed of 22 places in 33 ms
[2020-05-21 01:01:10] [INFO ] Deduced a trap composed of 28 places in 35 ms
[2020-05-21 01:01:10] [INFO ] Deduced a trap composed of 22 places in 35 ms
[2020-05-21 01:01:10] [INFO ] Deduced a trap composed of 26 places in 26 ms
[2020-05-21 01:01:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 362 ms
[2020-05-21 01:01:10] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-05-21 01:01:10] [INFO ] Added : 117 causal constraints over 24 iterations in 216 ms. Result :sat
[2020-05-21 01:01:10] [INFO ] Deduced a trap composed of 12 places in 29 ms
[2020-05-21 01:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-21 01:01:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-21 01:01:10] [INFO ] Flatten gal took : 50 ms
FORMULA Peterson-PT-2-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 01:01:10] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 01:01:10] [INFO ] Applying decomposition
[2020-05-21 01:01:10] [INFO ] Flatten gal took : 23 ms
[2020-05-21 01:01:10] [INFO ] Input system was already deterministic with 126 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph12752942984763561467.txt, -o, /tmp/graph12752942984763561467.bin, -w, /tmp/graph12752942984763561467.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12752942984763561467.bin, -l, -1, -v, -w, /tmp/graph12752942984763561467.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 120 out of 126 initially.
// Phase 1: matrix 120 rows 102 cols
[2020-05-21 01:01:11] [INFO ] Computed 11 place invariants in 3 ms
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + EndTurn_2_0 + EndTurn_2_1 + BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_0_2 + BeginLoop_2_1_2 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_1_1 + TestAlone_2_0_1 + TestTurn_2_1 + TestIdentity_2_0_0 + TestTurn_2_0 + TestIdentity_2_0_1 + TestIdentity_2_1_0 + TestIdentity_2_1_2 + TestIdentity_2_1_1 + TestIdentity_2_0_2 + Idle_2 + AskForSection_2_1 + AskForSection_2_0 + CS_2 = 1
inv : WantSection_0_T + Idle_0 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + EndTurn_1_0 + EndTurn_1_1 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + BeginLoop_1_0_1 + BeginLoop_1_1_1 + BeginLoop_1_1_2 + BeginLoop_1_0_2 + TestAlone_1_0_0 + TestAlone_1_1_0 + TestAlone_1_1_2 + TestAlone_1_0_2 + TestIdentity_1_0_0 + TestTurn_1_0 + TestTurn_1_1 + TestIdentity_1_0_1 + TestIdentity_1_1_1 + TestIdentity_1_1_0 + TestIdentity_1_1_2 + TestIdentity_1_0_2 + Idle_1 + CS_1 + AskForSection_1_1 + AskForSection_1_0 = 1
inv : WantSection_1_T + Idle_1 = 1
inv : WantSection_2_F - Idle_2 = 0
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + EndTurn_0_0 + EndTurn_0_1 + BeginLoop_0_0_0 + BeginLoop_0_1_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestTurn_0_0 + TestAlone_0_1_2 + TestIdentity_0_0_0 + TestTurn_0_1 + TestIdentity_0_1_1 + TestIdentity_0_1_0 + TestIdentity_0_0_1 + TestIdentity_0_1_2 + TestIdentity_0_0_2 + Idle_0 + CS_0 + AskForSection_0_1 + AskForSection_0_0 = 1
inv : WantSection_2_T + Idle_2 = 1
inv : Turn_1_2 + Turn_1_0 + Turn_1_1 = 1
inv : WantSection_0_F - Idle_0 = 0
inv : Turn_0_0 + Turn_0_1 + Turn_0_2 = 1
inv : WantSection_1_F - Idle_1 = 0
Total of 11 invariants.
[2020-05-21 01:01:11] [INFO ] Computed 11 place invariants in 7 ms
[2020-05-21 01:01:11] [INFO ] Decomposing Gal with order
[2020-05-21 01:01:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 01:01:11] [INFO ] Removed a total of 65 redundant transitions.
[2020-05-21 01:01:11] [INFO ] Flatten gal took : 84 ms
[2020-05-21 01:01:11] [INFO ] Proved 102 variables to be positive in 167 ms
[2020-05-21 01:01:11] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2020-05-21 01:01:11] [INFO ] Computation of disable matrix completed :0/126 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:01:11] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:01:11] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2020-05-21 01:01:11] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:01:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-21 01:01:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-21 01:01:11] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 15 LTL properties
Checking formula 0 : !((X(!(F(X("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))"))))))
Formula 0 simplified : !X!FX"(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))"
built 18 ordering constraints for composite.
built 12 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 17 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions NotAlone_0_2_0, NotAlone_1_2_0, NotAlone_2_1_1, NotAlone_0_2_1, NotAlone_1_2_1, UpdateTurn_1_0_0, UpdateTurn_2_1_0, UpdateTurn_2_0_0, UpdateTurn_0_1_0, UpdateTurn_0_2_1, UpdateTurn_2_1_1, UpdateTurn_1_2_1, UpdateTurn_2_0_1, UpdateTurn_1_0_1, UpdateTurn_0_1_1, UpdateTurn_1_2_0, UpdateTurn_0_2_0, BecomeIdle_2, BecomeIdle_1, BecomeIdle_0, i0.i2.u7.UpdateTurn_2_2_1, i1.i0.u36.UpdateTurn_1_1_1, i2.NotAlone_2_1_0, i2.i1.u37.UpdateTurn_2_2_0, i2.i2.u33.EndLoop_2_0, i4.i1.u8.EndLoop_1_0, i4.i1.u38.UpdateTurn_1_1_0, i5.u23.UpdateTurn_0_0_0, i6.u5.EndLoop_0_0, i6.u27.UpdateTurn_0_0_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/30/126
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
26 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.289332,24300,1,0,14683,249,2117,27521,189,778,55212
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Peterson-PT-2-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((X("(((((((((((((i2.i1.u37.TestTurn_2_0>=1)&&(i4.i1.u38.Turn_0_1>=1))||((i0.i2.u7.TestTurn_2_1>=1)&&(i6.u27.Turn_1_0>=1)))||((i4.i1.u38.TestTurn_1_0>=1)&&(i2.i1.u37.Turn_0_2>=1)))||((i6.u27.TestTurn_0_1>=1)&&(i1.i0.u36.Turn_1_1>=1)))||((i2.i1.u37.TestTurn_2_0>=1)&&(i5.u23.Turn_0_0>=1)))||((i1.i0.u36.TestTurn_1_1>=1)&&(i6.u27.Turn_1_0>=1)))||((i4.i1.u38.TestTurn_1_0>=1)&&(i5.u23.Turn_0_0>=1)))||((i0.i2.u7.TestTurn_2_1>=1)&&(i1.i0.u36.Turn_1_1>=1)))||((i5.u23.TestTurn_0_0>=1)&&(i4.i1.u38.Turn_0_1>=1)))||((i5.u23.TestTurn_0_0>=1)&&(i2.i1.u37.Turn_0_2>=1)))||((i1.i0.u36.TestTurn_1_1>=1)&&(i0.i2.u7.Turn_1_2>=1)))||((i6.u27.TestTurn_0_1>=1)&&(i0.i2.u7.Turn_1_2>=1)))"))&&((X(X((X(!(F("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))"))))&&("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))"))))||("(((((((((((((((((((i4.i1.u38.Turn_0_1<1)||(i5.u23.AskForSection_0_0<1))&&((i4.i1.u38.Turn_0_1<1)||(i4.i1.u38.AskForSection_1_0<1)))&&((i5.u23.Turn_0_0<1)||(i5.u23.AskForSection_0_0<1)))&&((i5.u23.Turn_0_0<1)||(i4.i1.u38.AskForSection_1_0<1)))&&((i0.i2.u7.Turn_1_2<1)||(i0.i2.u7.AskForSection_2_1<1)))&&((i2.i1.u37.Turn_0_2<1)||(i2.i1.u37.AskForSection_2_0<1)))&&((i4.i1.u38.Turn_0_1<1)||(i2.i1.u37.AskForSection_2_0<1)))&&((i2.i1.u37.Turn_0_2<1)||(i4.i1.u38.AskForSection_1_0<1)))&&((i0.i2.u7.Turn_1_2<1)||(i1.i0.u36.AskForSection_1_1<1)))&&((i2.i1.u37.Turn_0_2<1)||(i5.u23.AskForSection_0_0<1)))&&((i0.i2.u7.Turn_1_2<1)||(i6.u27.AskForSection_0_1<1)))&&((i6.u27.Turn_1_0<1)||(i0.i2.u7.AskForSection_2_1<1)))&&((i6.u27.Turn_1_0<1)||(i1.i0.u36.AskForSection_1_1<1)))&&((i6.u27.Turn_1_0<1)||(i6.u27.AskForSection_0_1<1)))&&((i1.i0.u36.Turn_1_1<1)||(i6.u27.AskForSection_0_1<1)))&&((i1.i0.u36.Turn_1_1<1)||(i0.i2.u7.AskForSection_2_1<1)))&&((i1.i0.u36.Turn_1_1<1)||(i1.i0.u36.AskForSection_1_1<1)))&&((i5.u23.Turn_0_0<1)||(i2.i1.u37.AskForSection_2_0<1)))")))))
Formula 1 simplified : !G(X"(((((((((((((i2.i1.u37.TestTurn_2_0>=1)&&(i4.i1.u38.Turn_0_1>=1))||((i0.i2.u7.TestTurn_2_1>=1)&&(i6.u27.Turn_1_0>=1)))||((i4.i1.u38.TestTurn_1_0>=1)&&(i2.i1.u37.Turn_0_2>=1)))||((i6.u27.TestTurn_0_1>=1)&&(i1.i0.u36.Turn_1_1>=1)))||((i2.i1.u37.TestTurn_2_0>=1)&&(i5.u23.Turn_0_0>=1)))||((i1.i0.u36.TestTurn_1_1>=1)&&(i6.u27.Turn_1_0>=1)))||((i4.i1.u38.TestTurn_1_0>=1)&&(i5.u23.Turn_0_0>=1)))||((i0.i2.u7.TestTurn_2_1>=1)&&(i1.i0.u36.Turn_1_1>=1)))||((i5.u23.TestTurn_0_0>=1)&&(i4.i1.u38.Turn_0_1>=1)))||((i5.u23.TestTurn_0_0>=1)&&(i2.i1.u37.Turn_0_2>=1)))||((i1.i0.u36.TestTurn_1_1>=1)&&(i0.i2.u7.Turn_1_2>=1)))||((i6.u27.TestTurn_0_1>=1)&&(i0.i2.u7.Turn_1_2>=1)))" & ("(((((((((((((((((((i4.i1.u38.Turn_0_1<1)||(i5.u23.AskForSection_0_0<1))&&((i4.i1.u38.Turn_0_1<1)||(i4.i1.u38.AskForSection_1_0<1)))&&((i5.u23.Turn_0_0<1)||(i5.u23.AskForSection_0_0<1)))&&((i5.u23.Turn_0_0<1)||(i4.i1.u38.AskForSection_1_0<1)))&&((i0.i2.u7.Turn_1_2<1)||(i0.i2.u7.AskForSection_2_1<1)))&&((i2.i1.u37.Turn_0_2<1)||(i2.i1.u37.AskForSection_2_0<1)))&&((i4.i1.u38.Turn_0_1<1)||(i2.i1.u37.AskForSection_2_0<1)))&&((i2.i1.u37.Turn_0_2<1)||(i4.i1.u38.AskForSection_1_0<1)))&&((i0.i2.u7.Turn_1_2<1)||(i1.i0.u36.AskForSection_1_1<1)))&&((i2.i1.u37.Turn_0_2<1)||(i5.u23.AskForSection_0_0<1)))&&((i0.i2.u7.Turn_1_2<1)||(i6.u27.AskForSection_0_1<1)))&&((i6.u27.Turn_1_0<1)||(i0.i2.u7.AskForSection_2_1<1)))&&((i6.u27.Turn_1_0<1)||(i1.i0.u36.AskForSection_1_1<1)))&&((i6.u27.Turn_1_0<1)||(i6.u27.AskForSection_0_1<1)))&&((i1.i0.u36.Turn_1_1<1)||(i6.u27.AskForSection_0_1<1)))&&((i1.i0.u36.Turn_1_1<1)||(i0.i2.u7.AskForSection_2_1<1)))&&((i1.i0.u36.Turn_1_1<1)||(i1.i0.u36.AskForSection_1_1<1)))&&((i5.u23.Turn_0_0<1)||(i2.i1.u37.AskForSection_2_0<1)))" | XX("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))" & X!F"(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.313535,25744,1,0,15231,249,2366,28232,194,779,57671
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Peterson-PT-2-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("(((i6.u5.EndTurn_0_0>=1)||(i2.i2.u33.EndTurn_2_0>=1))||(i4.i1.u8.EndTurn_1_0>=1))")))
Formula 2 simplified : !F"(((i6.u5.EndTurn_0_0>=1)||(i2.i2.u33.EndTurn_2_0>=1))||(i4.i1.u8.EndTurn_1_0>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.425888,30284,1,0,24711,254,2396,47628,194,810,81072
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-PT-2-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((X(X("(((((((((((((i6.u21.WantSection_2_F>=1)&&(i4.i0.u19.TestAlone_1_0_2>=1))||((i6.u21.WantSection_2_F>=1)&&(i1.i1.u18.TestAlone_1_1_2>=1)))||((i6.u21.WantSection_2_F>=1)&&(i3.i0.u31.TestAlone_0_1_2>=1)))||((i4.i0.u12.WantSection_0_F>=1)&&(i0.i2.u14.TestAlone_2_1_0>=1)))||((i4.i0.u12.WantSection_0_F>=1)&&(i1.i0.u11.TestAlone_1_1_0>=1)))||((i2.i2.u3.WantSection_1_F>=1)&&(i0.i0.u22.TestAlone_2_1_1>=1)))||((i2.i2.u3.WantSection_1_F>=1)&&(i3.i1.u29.TestAlone_0_1_1>=1)))||((i2.i2.u3.WantSection_1_F>=1)&&(i2.i0.u28.TestAlone_2_0_1>=1)))||((i2.i2.u3.WantSection_1_F>=1)&&(i5.u15.TestAlone_0_0_1>=1)))||((i6.u21.WantSection_2_F>=1)&&(i5.u32.TestAlone_0_0_2>=1)))||((i4.i1.u25.TestAlone_1_0_0>=1)&&(i4.i0.u12.WantSection_0_F>=1)))||((i4.i0.u12.WantSection_0_F>=1)&&(i2.i1.u26.TestAlone_2_0_0>=1)))")))||((!(X("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))")))&&("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))")))))
Formula 3 simplified : !F(XX"(((((((((((((i6.u21.WantSection_2_F>=1)&&(i4.i0.u19.TestAlone_1_0_2>=1))||((i6.u21.WantSection_2_F>=1)&&(i1.i1.u18.TestAlone_1_1_2>=1)))||((i6.u21.WantSection_2_F>=1)&&(i3.i0.u31.TestAlone_0_1_2>=1)))||((i4.i0.u12.WantSection_0_F>=1)&&(i0.i2.u14.TestAlone_2_1_0>=1)))||((i4.i0.u12.WantSection_0_F>=1)&&(i1.i0.u11.TestAlone_1_1_0>=1)))||((i2.i2.u3.WantSection_1_F>=1)&&(i0.i0.u22.TestAlone_2_1_1>=1)))||((i2.i2.u3.WantSection_1_F>=1)&&(i3.i1.u29.TestAlone_0_1_1>=1)))||((i2.i2.u3.WantSection_1_F>=1)&&(i2.i0.u28.TestAlone_2_0_1>=1)))||((i2.i2.u3.WantSection_1_F>=1)&&(i5.u15.TestAlone_0_0_1>=1)))||((i6.u21.WantSection_2_F>=1)&&(i5.u32.TestAlone_0_0_2>=1)))||((i4.i1.u25.TestAlone_1_0_0>=1)&&(i4.i0.u12.WantSection_0_F>=1)))||((i4.i0.u12.WantSection_0_F>=1)&&(i2.i1.u26.TestAlone_2_0_0>=1)))" | ("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))" & !X"(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.508055,32616,1,0,29031,254,2481,54396,194,810,95574
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Peterson-PT-2-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((("(((((((((((((i6.u21.WantSection_2_T<1)||(i4.i0.u19.TestAlone_1_0_2<1))&&((i4.i0.u34.WantSection_0_T<1)||(i2.i1.u26.TestAlone_2_0_0<1)))&&((i6.u21.WantSection_2_T<1)||(i1.i1.u18.TestAlone_1_1_2<1)))&&((i6.u21.WantSection_2_T<1)||(i3.i0.u31.TestAlone_0_1_2<1)))&&((i2.i2.u20.WantSection_1_T<1)||(i2.i0.u28.TestAlone_2_0_1<1)))&&((i2.i2.u20.WantSection_1_T<1)||(i3.i1.u29.TestAlone_0_1_1<1)))&&((i2.i2.u20.WantSection_1_T<1)||(i0.i0.u22.TestAlone_2_1_1<1)))&&((i6.u21.WantSection_2_T<1)||(i5.u32.TestAlone_0_0_2<1)))&&((i4.i0.u34.WantSection_0_T<1)||(i4.i1.u25.TestAlone_1_0_0<1)))&&((i4.i0.u34.WantSection_0_T<1)||(i0.i2.u14.TestAlone_2_1_0<1)))&&((i2.i2.u20.WantSection_1_T<1)||(i5.u15.TestAlone_0_0_1<1)))&&((i4.i0.u34.WantSection_0_T<1)||(i1.i0.u11.TestAlone_1_1_0<1)))")U("(((i1.i0.u9.EndTurn_1_1>=1)||(i6.u35.EndTurn_0_1>=1))||(i0.i1.u10.EndTurn_2_1>=1))"))U((G(X(G(F("(((((((((((((i6.u21.WantSection_2_T>=1)&&(i4.i0.u19.TestAlone_1_0_2>=1))||((i4.i0.u34.WantSection_0_T>=1)&&(i2.i1.u26.TestAlone_2_0_0>=1)))||((i6.u21.WantSection_2_T>=1)&&(i1.i1.u18.TestAlone_1_1_2>=1)))||((i6.u21.WantSection_2_T>=1)&&(i3.i0.u31.TestAlone_0_1_2>=1)))||((i2.i2.u20.WantSection_1_T>=1)&&(i2.i0.u28.TestAlone_2_0_1>=1)))||((i2.i2.u20.WantSection_1_T>=1)&&(i3.i1.u29.TestAlone_0_1_1>=1)))||((i2.i2.u20.WantSection_1_T>=1)&&(i0.i0.u22.TestAlone_2_1_1>=1)))||((i6.u21.WantSection_2_T>=1)&&(i5.u32.TestAlone_0_0_2>=1)))||((i4.i0.u34.WantSection_0_T>=1)&&(i4.i1.u25.TestAlone_1_0_0>=1)))||((i4.i0.u34.WantSection_0_T>=1)&&(i0.i2.u14.TestAlone_2_1_0>=1)))||((i2.i2.u20.WantSection_1_T>=1)&&(i5.u15.TestAlone_0_0_1>=1)))||((i4.i0.u34.WantSection_0_T>=1)&&(i1.i0.u11.TestAlone_1_1_0>=1)))")))))U(F(X("((((((((((((i5.u24.IsEndLoop_0_0_0>=1)||(i4.i0.u12.IsEndLoop_1_0_0>=1))||(i2.i0.u13.IsEndLoop_2_0_0>=1))||(i3.i1.u0.IsEndLoop_0_1_0>=1))||(i1.i1.u16.IsEndLoop_1_1_0>=1))||(i0.i0.u1.IsEndLoop_2_1_0>=1))||(i5.u32.IsEndLoop_0_0_1>=1))||(i4.i0.u2.IsEndLoop_1_0_1>=1))||(i2.i2.u3.IsEndLoop_2_0_1>=1))||(i3.i0.u17.IsEndLoop_0_1_1>=1))||(i1.i1.u30.IsEndLoop_1_1_1>=1))||(i0.i1.u4.IsEndLoop_2_1_1>=1))"))))))
Formula 4 simplified : !(("(((((((((((((i6.u21.WantSection_2_T<1)||(i4.i0.u19.TestAlone_1_0_2<1))&&((i4.i0.u34.WantSection_0_T<1)||(i2.i1.u26.TestAlone_2_0_0<1)))&&((i6.u21.WantSection_2_T<1)||(i1.i1.u18.TestAlone_1_1_2<1)))&&((i6.u21.WantSection_2_T<1)||(i3.i0.u31.TestAlone_0_1_2<1)))&&((i2.i2.u20.WantSection_1_T<1)||(i2.i0.u28.TestAlone_2_0_1<1)))&&((i2.i2.u20.WantSection_1_T<1)||(i3.i1.u29.TestAlone_0_1_1<1)))&&((i2.i2.u20.WantSection_1_T<1)||(i0.i0.u22.TestAlone_2_1_1<1)))&&((i6.u21.WantSection_2_T<1)||(i5.u32.TestAlone_0_0_2<1)))&&((i4.i0.u34.WantSection_0_T<1)||(i4.i1.u25.TestAlone_1_0_0<1)))&&((i4.i0.u34.WantSection_0_T<1)||(i0.i2.u14.TestAlone_2_1_0<1)))&&((i2.i2.u20.WantSection_1_T<1)||(i5.u15.TestAlone_0_0_1<1)))&&((i4.i0.u34.WantSection_0_T<1)||(i1.i0.u11.TestAlone_1_1_0<1)))" U "(((i1.i0.u9.EndTurn_1_1>=1)||(i6.u35.EndTurn_0_1>=1))||(i0.i1.u10.EndTurn_2_1>=1))") U (GXGF"(((((((((((((i6.u21.WantSection_2_T>=1)&&(i4.i0.u19.TestAlone_1_0_2>=1))||((i4.i0.u34.WantSection_0_T>=1)&&(i2.i1.u26.TestAlone_2_0_0>=1)))||((i6.u21.WantSection_2_T>=1)&&(i1.i1.u18.TestAlone_1_1_2>=1)))||((i6.u21.WantSection_2_T>=1)&&(i3.i0.u31.TestAlone_0_1_2>=1)))||((i2.i2.u20.WantSection_1_T>=1)&&(i2.i0.u28.TestAlone_2_0_1>=1)))||((i2.i2.u20.WantSection_1_T>=1)&&(i3.i1.u29.TestAlone_0_1_1>=1)))||((i2.i2.u20.WantSection_1_T>=1)&&(i0.i0.u22.TestAlone_2_1_1>=1)))||((i6.u21.WantSection_2_T>=1)&&(i5.u32.TestAlone_0_0_2>=1)))||((i4.i0.u34.WantSection_0_T>=1)&&(i4.i1.u25.TestAlone_1_0_0>=1)))||((i4.i0.u34.WantSection_0_T>=1)&&(i0.i2.u14.TestAlone_2_1_0>=1)))||((i2.i2.u20.WantSection_1_T>=1)&&(i5.u15.TestAlone_0_0_1>=1)))||((i4.i0.u34.WantSection_0_T>=1)&&(i1.i0.u11.TestAlone_1_1_0>=1)))" U FX"((((((((((((i5.u24.IsEndLoop_0_0_0>=1)||(i4.i0.u12.IsEndLoop_1_0_0>=1))||(i2.i0.u13.IsEndLoop_2_0_0>=1))||(i3.i1.u0.IsEndLoop_0_1_0>=1))||(i1.i1.u16.IsEndLoop_1_1_0>=1))||(i0.i0.u1.IsEndLoop_2_1_0>=1))||(i5.u32.IsEndLoop_0_0_1>=1))||(i4.i0.u2.IsEndLoop_1_0_1>=1))||(i2.i2.u3.IsEndLoop_2_0_1>=1))||(i3.i0.u17.IsEndLoop_0_1_1>=1))||(i1.i1.u30.IsEndLoop_1_1_1>=1))||(i0.i1.u4.IsEndLoop_2_1_1>=1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.568407,35700,1,0,33050,254,2543,59797,194,812,106625
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Peterson-PT-2-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(((X((X(G(("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))")U("((((((((((((i5.u32.TestIdentity_0_0_2>=1)||(i2.i1.u26.TestIdentity_2_0_0>=1))||(i0.i0.u22.TestIdentity_2_1_1>=1))||(i4.i0.u19.TestIdentity_1_0_2>=1))||(i3.i1.u29.TestIdentity_0_1_1>=1))||(i2.i0.u28.TestIdentity_2_0_1>=1))||(i0.i2.u14.TestIdentity_2_1_0>=1))||(i1.i0.u11.TestIdentity_1_1_0>=1))||(i1.i1.u18.TestIdentity_1_1_2>=1))||(i5.u15.TestIdentity_0_0_1>=1))||(i4.i1.u25.TestIdentity_1_0_0>=1))||(i3.i0.u31.TestIdentity_0_1_2>=1))"))))&&("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))")))&&("((((((i0.i1.u6.TestIdentity_2_1_2>=1)||(i2.i2.u33.TestIdentity_2_0_2>=1))||(i4.i0.u2.TestIdentity_1_0_1>=1))||(i3.i1.u0.TestIdentity_0_1_0>=1))||(i1.i1.u30.TestIdentity_1_1_1>=1))||(i5.u24.TestIdentity_0_0_0>=1))"))&&("(((i6.u5.EndTurn_0_0>=1)||(i2.i2.u33.EndTurn_2_0>=1))||(i4.i1.u8.EndTurn_1_0>=1))"))))
Formula 5 simplified : !F("((((((i0.i1.u6.TestIdentity_2_1_2>=1)||(i2.i2.u33.TestIdentity_2_0_2>=1))||(i4.i0.u2.TestIdentity_1_0_1>=1))||(i3.i1.u0.TestIdentity_0_1_0>=1))||(i1.i1.u30.TestIdentity_1_1_1>=1))||(i5.u24.TestIdentity_0_0_0>=1))" & "(((i6.u5.EndTurn_0_0>=1)||(i2.i2.u33.EndTurn_2_0>=1))||(i4.i1.u8.EndTurn_1_0>=1))" & X("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))" & XG("(((((((((((((((((((i4.i1.u38.Turn_0_1>=1)&&(i5.u23.AskForSection_0_0>=1))||((i4.i1.u38.Turn_0_1>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i5.u23.Turn_0_0>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i4.i1.u38.Turn_0_1>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i4.i1.u38.AskForSection_1_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i2.i1.u37.Turn_0_2>=1)&&(i5.u23.AskForSection_0_0>=1)))||((i0.i2.u7.Turn_1_2>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i6.u27.Turn_1_0>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i6.u27.AskForSection_0_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1)))||((i1.i0.u36.Turn_1_1>=1)&&(i1.i0.u36.AskForSection_1_1>=1)))||((i5.u23.Turn_0_0>=1)&&(i2.i1.u37.AskForSection_2_0>=1)))" U "((((((((((((i5.u32.TestIdentity_0_0_2>=1)||(i2.i1.u26.TestIdentity_2_0_0>=1))||(i0.i0.u22.TestIdentity_2_1_1>=1))||(i4.i0.u19.TestIdentity_1_0_2>=1))||(i3.i1.u29.TestIdentity_0_1_1>=1))||(i2.i0.u28.TestIdentity_2_0_1>=1))||(i0.i2.u14.TestIdentity_2_1_0>=1))||(i1.i0.u11.TestIdentity_1_1_0>=1))||(i1.i1.u18.TestIdentity_1_1_2>=1))||(i5.u15.TestIdentity_0_0_1>=1))||(i4.i1.u25.TestIdentity_1_0_0>=1))||(i3.i0.u31.TestIdentity_0_1_2>=1))")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
66 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,1.22904,56164,1,0,74576,261,2577,128295,194,848,182058
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Peterson-PT-2-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(X(X("(((((((i4.i1.u38.TestTurn_1_0>=1)&&(i4.i1.u38.Turn_0_1>=1))||((i5.u23.TestTurn_0_0>=1)&&(i5.u23.Turn_0_0>=1)))||((i0.i2.u7.TestTurn_2_1>=1)&&(i0.i2.u7.Turn_1_2>=1)))||((i1.i0.u36.TestTurn_1_1>=1)&&(i1.i0.u36.Turn_1_1>=1)))||((i2.i1.u37.TestTurn_2_0>=1)&&(i2.i1.u37.Turn_0_2>=1)))||((i6.u27.TestTurn_0_1>=1)&&(i6.u27.Turn_1_0>=1)))"))))U(G("(((((((i4.i1.u38.TestTurn_1_0>=1)&&(i4.i1.u38.Turn_0_1>=1))||((i5.u23.TestTurn_0_0>=1)&&(i5.u23.Turn_0_0>=1)))||((i0.i2.u7.TestTurn_2_1>=1)&&(i0.i2.u7.Turn_1_2>=1)))||((i1.i0.u36.TestTurn_1_1>=1)&&(i1.i0.u36.Turn_1_1>=1)))||((i2.i1.u37.TestTurn_2_0>=1)&&(i2.i1.u37.Turn_0_2>=1)))||((i6.u27.TestTurn_0_1>=1)&&(i6.u27.Turn_1_0>=1)))"))))
Formula 6 simplified : !(!XX"(((((((i4.i1.u38.TestTurn_1_0>=1)&&(i4.i1.u38.Turn_0_1>=1))||((i5.u23.TestTurn_0_0>=1)&&(i5.u23.Turn_0_0>=1)))||((i0.i2.u7.TestTurn_2_1>=1)&&(i0.i2.u7.Turn_1_2>=1)))||((i1.i0.u36.TestTurn_1_1>=1)&&(i1.i0.u36.Turn_1_1>=1)))||((i2.i1.u37.TestTurn_2_0>=1)&&(i2.i1.u37.Turn_0_2>=1)))||((i6.u27.TestTurn_0_1>=1)&&(i6.u27.Turn_1_0>=1)))" U G"(((((((i4.i1.u38.TestTurn_1_0>=1)&&(i4.i1.u38.Turn_0_1>=1))||((i5.u23.TestTurn_0_0>=1)&&(i5.u23.Turn_0_0>=1)))||((i0.i2.u7.TestTurn_2_1>=1)&&(i0.i2.u7.Turn_1_2>=1)))||((i1.i0.u36.TestTurn_1_1>=1)&&(i1.i0.u36.Turn_1_1>=1)))||((i2.i1.u37.TestTurn_2_0>=1)&&(i2.i1.u37.Turn_0_2>=1)))||((i6.u27.TestTurn_0_1>=1)&&(i6.u27.Turn_1_0>=1)))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 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,1.23697,56416,1,0,74781,261,2624,128581,196,849,182945
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Peterson-PT-2-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(("((i2.i2.u3.WantSection_1_F<1)||(i2.i2.u20.Idle_1<1))")U((G(F("(i1.i1.u30.TestIdentity_1_1_1>=1)")))U("((i2.i2.u3.WantSection_1_F>=1)&&(i2.i2.u20.Idle_1>=1))")))))
Formula 7 simplified : !G("((i2.i2.u3.WantSection_1_F<1)||(i2.i2.u20.Idle_1<1))" U (GF"(i1.i1.u30.TestIdentity_1_1_1>=1)" U "((i2.i2.u3.WantSection_1_F>=1)&&(i2.i2.u20.Idle_1>=1))"))
18 unique states visited
18 strongly connected components in search stack
19 transitions explored
18 items max in DFS search stack
9 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,1.33567,58768,1,0,79200,262,2713,135826,196,885,199147
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Peterson-PT-2-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(((("((i5.u23.TestTurn_0_0>=1)&&(i4.i1.u38.Turn_0_1>=1))")U("(i1.i1.u30.TestIdentity_1_1_1>=1)"))&&(("(i1.i0.u9.EndTurn_1_1>=1)")U(G((X("((i5.u23.TestTurn_0_0>=1)&&(i4.i1.u38.Turn_0_1>=1))"))||("((i6.u21.WantSection_2_F>=1)&&(i4.i0.u19.TestAlone_1_0_2>=1))")))))&&("((i5.u23.TestTurn_0_0<1)||(i4.i1.u38.Turn_0_1<1))"))))
Formula 8 simplified : !X("((i5.u23.TestTurn_0_0<1)||(i4.i1.u38.Turn_0_1<1))" & ("((i5.u23.TestTurn_0_0>=1)&&(i4.i1.u38.Turn_0_1>=1))" U "(i1.i1.u30.TestIdentity_1_1_1>=1)") & ("(i1.i0.u9.EndTurn_1_1>=1)" U G("((i6.u21.WantSection_2_F>=1)&&(i4.i0.u19.TestAlone_1_0_2>=1))" | X"((i5.u23.TestTurn_0_0>=1)&&(i4.i1.u38.Turn_0_1>=1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 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,1.34181,59024,1,0,79200,262,2789,135826,196,885,199247
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Peterson-PT-2-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(((!(X((G(X("(i6.u5.IsEndLoop_0_0_2>=1)")))&&(!(G("((i2.i1.u37.TestTurn_2_0>=1)&&(i4.i1.u38.Turn_0_1>=1))"))))))&&("(i6.u5.IsEndLoop_0_0_2<1)"))&&("((i2.i2.u3.WantSection_1_F<1)||(i2.i0.u28.TestAlone_2_0_1<1))"))))
Formula 9 simplified : !F("((i2.i2.u3.WantSection_1_F<1)||(i2.i0.u28.TestAlone_2_0_1<1))" & "(i6.u5.IsEndLoop_0_0_2<1)" & !X(GX"(i6.u5.IsEndLoop_0_0_2>=1)" & !G"((i2.i1.u37.TestTurn_2_0>=1)&&(i4.i1.u38.Turn_0_1>=1))"))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 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,1.34497,59024,1,0,79200,262,2852,135826,198,885,199415
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Peterson-PT-2-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((!(G((F(G("((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1))")))U("((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1))"))))&&(((!(X("((i2.i2.u3.WantSection_1_F>=1)&&(i2.i2.u20.Idle_1>=1))")))||("(i1.i0.u36.Turn_1_1<1)"))||("(i0.i2.u7.AskForSection_2_1<1)")))))
Formula 10 simplified : !F(!G(FG"((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1))" U "((i1.i0.u36.Turn_1_1>=1)&&(i0.i2.u7.AskForSection_2_1>=1))") & ("(i0.i2.u7.AskForSection_2_1<1)" | "(i1.i0.u36.Turn_1_1<1)" | !X"((i2.i2.u3.WantSection_1_F>=1)&&(i2.i2.u20.Idle_1>=1))"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
0 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,1.35202,59024,1,0,79475,262,2904,136123,198,885,201028
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Peterson-PT-2-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((((F(X("(i1.i0.u9.EndTurn_1_1>=1)")))U("((i6.u21.WantSection_2_F<1)||(i6.u21.Idle_2<1))"))||(!(F(X("((i6.u21.WantSection_2_F>=1)&&(i6.u21.Idle_2>=1))"))))))
Formula 11 simplified : !((FX"(i1.i0.u9.EndTurn_1_1>=1)" U "((i6.u21.WantSection_2_F<1)||(i6.u21.Idle_2<1))") | !FX"((i6.u21.WantSection_2_F>=1)&&(i6.u21.Idle_2>=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
9 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,1.44696,61912,1,0,84141,262,3043,141676,209,893,217448
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Peterson-PT-2-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F(!(F("((i4.i0.u34.WantSection_0_T<1)||(i1.i0.u11.TestAlone_1_1_0<1))"))))))
Formula 12 simplified : !GF!F"((i4.i0.u34.WantSection_0_T<1)||(i1.i0.u11.TestAlone_1_1_0<1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
35 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,1.7958,70888,1,0,103328,264,3071,164455,209,945,258064
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Peterson-PT-2-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!(G(X(("((i6.u21.WantSection_2_F>=1)&&(i3.i0.u31.TestAlone_0_1_2>=1))")U((G("((i0.i2.u7.TestTurn_2_1>=1)&&(i0.i2.u7.Turn_1_2>=1))"))&&("(i0.i1.u10.EndTurn_2_1>=1)")))))))
Formula 13 simplified : GX("((i6.u21.WantSection_2_F>=1)&&(i3.i0.u31.TestAlone_0_1_2>=1))" U ("(i0.i1.u10.EndTurn_2_1>=1)" & G"((i0.i2.u7.TestTurn_2_1>=1)&&(i0.i2.u7.Turn_1_2>=1))"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 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,1.79781,71416,1,0,103328,264,3099,164455,210,945,258093
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Peterson-PT-2-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((!(F("((((i0.i1.u6.TestIdentity_2_1_2<1)&&(i1.i0.u36.TestTurn_1_1>=1))&&(i0.i2.u7.Turn_1_2>=1))||((i4.i0.u19.TestIdentity_1_0_2>=1)&&(i6.u35.EndTurn_0_1>=1)))"))))
Formula 14 simplified : F"((((i0.i1.u6.TestIdentity_2_1_2<1)&&(i1.i0.u36.TestTurn_1_1>=1))&&(i0.i2.u7.Turn_1_2>=1))||((i4.i0.u19.TestIdentity_1_0_2>=1)&&(i6.u35.EndTurn_0_1>=1)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
46 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,2.25905,84616,1,0,131397,264,3136,198946,210,945,322659
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Peterson-PT-2-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 01:01:13] [INFO ] Built C files in 3060ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590022874208

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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"

# 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 r111-csrt-158961258000706"
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 ;