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-158961258000708.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000708
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME Peterson-PT-2-CTLFireability-01
FORMULA_NAME Peterson-PT-2-CTLFireability-02
FORMULA_NAME Peterson-PT-2-CTLFireability-03
FORMULA_NAME Peterson-PT-2-CTLFireability-04
FORMULA_NAME Peterson-PT-2-CTLFireability-05
FORMULA_NAME Peterson-PT-2-CTLFireability-06
FORMULA_NAME Peterson-PT-2-CTLFireability-07
FORMULA_NAME Peterson-PT-2-CTLFireability-08
FORMULA_NAME Peterson-PT-2-CTLFireability-09
FORMULA_NAME Peterson-PT-2-CTLFireability-10
FORMULA_NAME Peterson-PT-2-CTLFireability-11
FORMULA_NAME Peterson-PT-2-CTLFireability-12
FORMULA_NAME Peterson-PT-2-CTLFireability-13
FORMULA_NAME Peterson-PT-2-CTLFireability-14
FORMULA_NAME Peterson-PT-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590022890399

[2020-05-21 01:01:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:01:33] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-05-21 01:01:33] [INFO ] Transformed 102 places.
[2020-05-21 01:01:33] [INFO ] Transformed 126 transitions.
[2020-05-21 01:01:33] [INFO ] Parsed PT model containing 102 places and 126 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 381 ms. (steps per millisecond=262 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1]
[2020-05-21 01:01:34] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-05-21 01:01:34] [INFO ] Computed 11 place invariants in 11 ms
[2020-05-21 01:01:34] [INFO ] [Real]Absence check using 8 positive place invariants in 54 ms returned sat
[2020-05-21 01:01:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-21 01:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:34] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-05-21 01:01:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-05-21 01:01:34] [INFO ] [Real]Added 26 Read/Feed constraints in 38 ms returned sat
[2020-05-21 01:01:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2020-05-21 01:01:35] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:35] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-05-21 01:01:35] [INFO ] [Nat]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:01:36] [INFO ] Deduced a trap composed of 12 places in 1112 ms
[2020-05-21 01:01:36] [INFO ] Deduced a trap composed of 8 places in 142 ms
[2020-05-21 01:01:36] [INFO ] Deduced a trap composed of 26 places in 204 ms
[2020-05-21 01:01:36] [INFO ] Deduced a trap composed of 29 places in 104 ms
[2020-05-21 01:01:37] [INFO ] Deduced a trap composed of 12 places in 59 ms
[2020-05-21 01:01:37] [INFO ] Deduced a trap composed of 25 places in 40 ms
[2020-05-21 01:01:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1783 ms
[2020-05-21 01:01:37] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-05-21 01:01:37] [INFO ] Added : 111 causal constraints over 23 iterations in 536 ms. Result :sat
[2020-05-21 01:01:37] [INFO ] [Real]Absence check using 8 positive place invariants in 53 ms returned sat
[2020-05-21 01:01:37] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 24 ms returned sat
[2020-05-21 01:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:38] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2020-05-21 01:01:38] [INFO ] [Real]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-05-21 01:01:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-05-21 01:01:38] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 18 ms returned sat
[2020-05-21 01:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:38] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2020-05-21 01:01:38] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-21 01:01:38] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 36 ms.
[2020-05-21 01:01:39] [INFO ] Added : 117 causal constraints over 24 iterations in 516 ms. Result :sat
[2020-05-21 01:01:39] [INFO ] Deduced a trap composed of 11 places in 561 ms
[2020-05-21 01:01:39] [INFO ] Deduced a trap composed of 29 places in 202 ms
[2020-05-21 01:01:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 838 ms
[2020-05-21 01:01:39] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:01:39] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:40] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2020-05-21 01:01:40] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-21 01:01:40] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:40] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2020-05-21 01:01:40] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-05-21 01:01:40] [INFO ] Deduced a trap composed of 29 places in 23 ms
[2020-05-21 01:01:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2020-05-21 01:01:40] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 27 ms.
[2020-05-21 01:01:41] [INFO ] Added : 115 causal constraints over 23 iterations in 640 ms. Result :sat
[2020-05-21 01:01:41] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-21 01:01:41] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:41] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2020-05-21 01:01:41] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-05-21 01:01:41] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:41] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2020-05-21 01:01:41] [INFO ] [Nat]Added 26 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:01:41] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 17 ms.
[2020-05-21 01:01:42] [INFO ] Added : 117 causal constraints over 24 iterations in 413 ms. Result :sat
[2020-05-21 01:01:42] [INFO ] Deduced a trap composed of 11 places in 63 ms
[2020-05-21 01:01:42] [INFO ] Deduced a trap composed of 29 places in 156 ms
[2020-05-21 01:01:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2020-05-21 01:01:42] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-05-21 01:01:42] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 12 ms returned sat
[2020-05-21 01:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:42] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2020-05-21 01:01:42] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 36 ms returned sat
[2020-05-21 01:01:43] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:43] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2020-05-21 01:01:43] [INFO ] [Nat]Added 26 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:01:43] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 17 ms.
[2020-05-21 01:01:43] [INFO ] Added : 110 causal constraints over 23 iterations in 510 ms. Result :sat
[2020-05-21 01:01:44] [INFO ] Deduced a trap composed of 13 places in 522 ms
[2020-05-21 01:01:45] [INFO ] Deduced a trap composed of 11 places in 1066 ms
[2020-05-21 01:01:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1628 ms
[2020-05-21 01:01:45] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-21 01:01:45] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:45] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2020-05-21 01:01:45] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-05-21 01:01:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-05-21 01:01:45] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:45] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-05-21 01:01:45] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-05-21 01:01:45] [INFO ] Deduced a trap composed of 8 places in 71 ms
[2020-05-21 01:01:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2020-05-21 01:01:45] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-05-21 01:01:46] [INFO ] Added : 108 causal constraints over 22 iterations in 555 ms. Result :sat
[2020-05-21 01:01:47] [INFO ] Deduced a trap composed of 26 places in 1232 ms
[2020-05-21 01:01:47] [INFO ] Deduced a trap composed of 31 places in 79 ms
[2020-05-21 01:01:48] [INFO ] Deduced a trap composed of 12 places in 717 ms
[2020-05-21 01:01:49] [INFO ] Deduced a trap composed of 29 places in 838 ms
[2020-05-21 01:01:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2996 ms
[2020-05-21 01:01:49] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-21 01:01:49] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:49] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-05-21 01:01:49] [INFO ] [Real]Added 26 Read/Feed constraints in 14 ms returned sat
[2020-05-21 01:01:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-05-21 01:01:49] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 5 ms returned sat
[2020-05-21 01:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:49] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2020-05-21 01:01:49] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-05-21 01:01:49] [INFO ] Deduced a trap composed of 14 places in 281 ms
[2020-05-21 01:01:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2020-05-21 01:01:49] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 24 ms.
[2020-05-21 01:01:50] [INFO ] Added : 117 causal constraints over 24 iterations in 477 ms. Result :sat
[2020-05-21 01:01:50] [INFO ] Deduced a trap composed of 25 places in 236 ms
[2020-05-21 01:01:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2020-05-21 01:01:50] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-21 01:01:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:50] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-05-21 01:01:50] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-05-21 01:01:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:50] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2020-05-21 01:01:50] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-05-21 01:01:51] [INFO ] Deduced a trap composed of 29 places in 26 ms
[2020-05-21 01:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2020-05-21 01:01:51] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 23 ms.
[2020-05-21 01:01:51] [INFO ] Added : 109 causal constraints over 22 iterations in 409 ms. Result :sat
[2020-05-21 01:01:52] [INFO ] Deduced a trap composed of 12 places in 1035 ms
[2020-05-21 01:01:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1075 ms
[2020-05-21 01:01:52] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2020-05-21 01:01:52] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:52] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-05-21 01:01:52] [INFO ] [Real]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-05-21 01:01:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 33 ms returned sat
[2020-05-21 01:01:52] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:52] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2020-05-21 01:01:52] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-21 01:01:53] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 36 ms.
[2020-05-21 01:01:53] [INFO ] Added : 117 causal constraints over 24 iterations in 609 ms. Result :sat
[2020-05-21 01:01:53] [INFO ] Deduced a trap composed of 12 places in 320 ms
[2020-05-21 01:01:54] [INFO ] Deduced a trap composed of 15 places in 346 ms
[2020-05-21 01:01:54] [INFO ] Deduced a trap composed of 22 places in 50 ms
[2020-05-21 01:01:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 812 ms
[2020-05-21 01:01:54] [INFO ] [Real]Absence check using 8 positive place invariants in 49 ms returned sat
[2020-05-21 01:01:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 21 ms returned sat
[2020-05-21 01:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:54] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2020-05-21 01:01:54] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 29 ms returned sat
[2020-05-21 01:01:54] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 16 ms returned sat
[2020-05-21 01:01:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:55] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2020-05-21 01:01:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:01:56] [INFO ] Deduced a trap composed of 8 places in 864 ms
[2020-05-21 01:01:56] [INFO ] Deduced a trap composed of 12 places in 62 ms
[2020-05-21 01:01:56] [INFO ] Deduced a trap composed of 29 places in 334 ms
[2020-05-21 01:01:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1323 ms
[2020-05-21 01:01:56] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 15 ms.
[2020-05-21 01:01:57] [INFO ] Added : 117 causal constraints over 24 iterations in 619 ms. Result :sat
[2020-05-21 01:01:57] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned sat
[2020-05-21 01:01:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 20 ms returned sat
[2020-05-21 01:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:57] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2020-05-21 01:01:57] [INFO ] [Real]Added 26 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:01:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:01:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 32 ms returned sat
[2020-05-21 01:01:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 11 ms returned sat
[2020-05-21 01:01:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:01:58] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2020-05-21 01:01:58] [INFO ] [Nat]Added 26 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:01:58] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-05-21 01:01:58] [INFO ] Added : 116 causal constraints over 24 iterations in 288 ms. Result :sat
[2020-05-21 01:01:59] [INFO ] Deduced a trap composed of 12 places in 1110 ms
[2020-05-21 01:02:00] [INFO ] Deduced a trap composed of 25 places in 710 ms
[2020-05-21 01:02:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1858 ms
[2020-05-21 01:02:00] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-21 01:02:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:00] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-05-21 01:02:00] [INFO ] [Real]Added 26 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:02:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2020-05-21 01:02:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:00] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2020-05-21 01:02:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:02:00] [INFO ] Deduced a trap composed of 29 places in 56 ms
[2020-05-21 01:02:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2020-05-21 01:02:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 14 ms.
[2020-05-21 01:02:01] [INFO ] Added : 117 causal constraints over 24 iterations in 565 ms. Result :sat
[2020-05-21 01:02:01] [INFO ] Deduced a trap composed of 29 places in 29 ms
[2020-05-21 01:02:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2020-05-21 01:02:01] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-05-21 01:02:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 17 ms returned sat
[2020-05-21 01:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:01] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-05-21 01:02:01] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-05-21 01:02:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 30 ms returned sat
[2020-05-21 01:02:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:02] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2020-05-21 01:02:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 8 places in 143 ms
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 12 places in 128 ms
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 29 places in 331 ms
[2020-05-21 01:02:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 685 ms
[2020-05-21 01:02:02] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 39 ms.
[2020-05-21 01:02:03] [INFO ] Added : 110 causal constraints over 22 iterations in 325 ms. Result :sat
[2020-05-21 01:02:03] [INFO ] Deduced a trap composed of 11 places in 717 ms
[2020-05-21 01:02:05] [INFO ] Deduced a trap composed of 22 places in 1330 ms
[2020-05-21 01:02:05] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-05-21 01:02:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2284 ms
[2020-05-21 01:02:05] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:02:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:05] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-05-21 01:02:05] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-21 01:02:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-05-21 01:02:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:05] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-05-21 01:02:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 22 places in 309 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 22 places in 288 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 12 places in 265 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 8 places in 44 ms
[2020-05-21 01:02:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1026 ms
[2020-05-21 01:02:06] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 13 ms.
[2020-05-21 01:02:07] [INFO ] Added : 89 causal constraints over 18 iterations in 284 ms. Result :sat
[2020-05-21 01:02:07] [INFO ] [Real]Absence check using 8 positive place invariants in 50 ms returned sat
[2020-05-21 01:02:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 23 ms returned sat
[2020-05-21 01:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:08] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2020-05-21 01:02:08] [INFO ] [Real]Added 26 Read/Feed constraints in 31 ms returned sat
[2020-05-21 01:02:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 64 ms returned sat
[2020-05-21 01:02:08] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 31 ms returned sat
[2020-05-21 01:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:09] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2020-05-21 01:02:09] [INFO ] [Nat]Added 26 Read/Feed constraints in 29 ms returned sat
[2020-05-21 01:02:09] [INFO ] Deduced a trap composed of 22 places in 202 ms
[2020-05-21 01:02:09] [INFO ] Deduced a trap composed of 22 places in 70 ms
[2020-05-21 01:02:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2020-05-21 01:02:09] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 29 ms.
[2020-05-21 01:02:10] [INFO ] Added : 115 causal constraints over 24 iterations in 911 ms. Result :sat
[2020-05-21 01:02:10] [INFO ] [Real]Absence check using 8 positive place invariants in 36 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 24 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:10] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Real]Added 26 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:02:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:11] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2020-05-21 01:02:11] [INFO ] [Nat]Added 26 Read/Feed constraints in 14 ms returned sat
[2020-05-21 01:02:11] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 28 ms.
[2020-05-21 01:02:12] [INFO ] Added : 117 causal constraints over 24 iterations in 566 ms. Result :sat
[2020-05-21 01:02:12] [INFO ] Deduced a trap composed of 11 places in 305 ms
[2020-05-21 01:02:12] [INFO ] Deduced a trap composed of 8 places in 63 ms
[2020-05-21 01:02:13] [INFO ] Deduced a trap composed of 8 places in 825 ms
[2020-05-21 01:02:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1266 ms
[2020-05-21 01:02:13] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-05-21 01:02:13] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned unsat
[2020-05-21 01:02:13] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:02:13] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:13] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2020-05-21 01:02:13] [INFO ] [Real]Added 26 Read/Feed constraints in 14 ms returned sat
[2020-05-21 01:02:13] [INFO ] Deduced a trap composed of 8 places in 72 ms
[2020-05-21 01:02:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2020-05-21 01:02:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:02:13] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 9 ms returned sat
[2020-05-21 01:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:13] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-05-21 01:02:13] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:02:13] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-05-21 01:02:14] [INFO ] Added : 117 causal constraints over 24 iterations in 335 ms. Result :sat
[2020-05-21 01:02:14] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
[2020-05-21 01:02:14] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-21 01:02:14] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:14] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2020-05-21 01:02:14] [INFO ] [Real]Added 26 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:02:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 60 ms returned sat
[2020-05-21 01:02:14] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 16 ms returned sat
[2020-05-21 01:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:15] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2020-05-21 01:02:15] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-05-21 01:02:15] [INFO ] Deduced a trap composed of 8 places in 86 ms
[2020-05-21 01:02:15] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2020-05-21 01:02:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2020-05-21 01:02:15] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-05-21 01:02:15] [INFO ] Added : 110 causal constraints over 22 iterations in 244 ms. Result :sat
[2020-05-21 01:02:15] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-21 01:02:15] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:15] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2020-05-21 01:02:15] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:02:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-05-21 01:02:15] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:15] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2020-05-21 01:02:15] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-05-21 01:02:15] [INFO ] Deduced a trap composed of 29 places in 67 ms
[2020-05-21 01:02:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2020-05-21 01:02:15] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 35 ms.
[2020-05-21 01:02:16] [INFO ] Added : 108 causal constraints over 22 iterations in 311 ms. Result :sat
[2020-05-21 01:02:16] [INFO ] Deduced a trap composed of 12 places in 373 ms
[2020-05-21 01:02:16] [INFO ] Deduced a trap composed of 12 places in 71 ms
[2020-05-21 01:02:17] [INFO ] Deduced a trap composed of 8 places in 259 ms
[2020-05-21 01:02:17] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2020-05-21 01:02:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 991 ms
[2020-05-21 01:02:17] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-21 01:02:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:17] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-05-21 01:02:17] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:02:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-05-21 01:02:17] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 24 ms returned sat
[2020-05-21 01:02:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:17] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2020-05-21 01:02:17] [INFO ] [Nat]Added 26 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:02:18] [INFO ] Deduced a trap composed of 12 places in 179 ms
[2020-05-21 01:02:18] [INFO ] Deduced a trap composed of 8 places in 94 ms
[2020-05-21 01:02:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2020-05-21 01:02:18] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 23 ms.
[2020-05-21 01:02:18] [INFO ] Added : 117 causal constraints over 24 iterations in 669 ms. Result :sat
[2020-05-21 01:02:18] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2020-05-21 01:02:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-05-21 01:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:19] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2020-05-21 01:02:19] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:02:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-05-21 01:02:19] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:19] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2020-05-21 01:02:19] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-05-21 01:02:19] [INFO ] Deduced a trap composed of 8 places in 67 ms
[2020-05-21 01:02:19] [INFO ] Deduced a trap composed of 25 places in 66 ms
[2020-05-21 01:02:20] [INFO ] Deduced a trap composed of 12 places in 321 ms
[2020-05-21 01:02:20] [INFO ] Deduced a trap composed of 12 places in 189 ms
[2020-05-21 01:02:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 689 ms
[2020-05-21 01:02:20] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 20 ms.
[2020-05-21 01:02:20] [INFO ] Added : 112 causal constraints over 23 iterations in 368 ms. Result :sat
[2020-05-21 01:02:20] [INFO ] [Real]Absence check using 8 positive place invariants in 34 ms returned sat
[2020-05-21 01:02:20] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:20] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-05-21 01:02:20] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-21 01:02:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 92 ms returned sat
[2020-05-21 01:02:21] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 42 ms returned sat
[2020-05-21 01:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:21] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2020-05-21 01:02:21] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-05-21 01:02:22] [INFO ] Deduced a trap composed of 8 places in 775 ms
[2020-05-21 01:02:22] [INFO ] Deduced a trap composed of 12 places in 464 ms
[2020-05-21 01:02:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1289 ms
[2020-05-21 01:02:22] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 22 ms.
[2020-05-21 01:02:22] [INFO ] Added : 110 causal constraints over 22 iterations in 307 ms. Result :sat
[2020-05-21 01:02:23] [INFO ] [Real]Absence check using 8 positive place invariants in 36 ms returned sat
[2020-05-21 01:02:23] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 22 ms returned sat
[2020-05-21 01:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:23] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2020-05-21 01:02:23] [INFO ] [Real]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:02:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-05-21 01:02:23] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:23] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2020-05-21 01:02:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-05-21 01:02:24] [INFO ] Deduced a trap composed of 8 places in 661 ms
[2020-05-21 01:02:24] [INFO ] Deduced a trap composed of 29 places in 408 ms
[2020-05-21 01:02:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1113 ms
[2020-05-21 01:02:24] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 17 ms.
[2020-05-21 01:02:25] [INFO ] Added : 105 causal constraints over 21 iterations in 475 ms. Result :sat
[2020-05-21 01:02:25] [INFO ] Deduced a trap composed of 34 places in 577 ms
[2020-05-21 01:02:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 606 ms
[2020-05-21 01:02:26] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 24 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:26] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:02:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 10 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:26] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2020-05-21 01:02:26] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-05-21 01:02:27] [INFO ] Deduced a trap composed of 13 places in 34 ms
[2020-05-21 01:02:27] [INFO ] Deduced a trap composed of 8 places in 138 ms
[2020-05-21 01:02:27] [INFO ] Deduced a trap composed of 11 places in 467 ms
[2020-05-21 01:02:27] [INFO ] Deduced a trap composed of 22 places in 58 ms
[2020-05-21 01:02:28] [INFO ] Deduced a trap composed of 22 places in 579 ms
[2020-05-21 01:02:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1375 ms
[2020-05-21 01:02:28] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 12 ms.
[2020-05-21 01:02:28] [INFO ] Added : 117 causal constraints over 24 iterations in 505 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-21 01:02:29] [INFO ] Flatten gal took : 124 ms
[2020-05-21 01:02:29] [INFO ] Flatten gal took : 24 ms
[2020-05-21 01:02:29] [INFO ] Applying decomposition
[2020-05-21 01:02:29] [INFO ] Flatten gal took : 13 ms
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/graph17974048801189373889.txt, -o, /tmp/graph17974048801189373889.bin, -w, /tmp/graph17974048801189373889.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/graph17974048801189373889.bin, -l, -1, -v, -w, /tmp/graph17974048801189373889.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 01:02:29] [INFO ] Decomposing Gal with order
[2020-05-21 01:02:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 01:02:29] [INFO ] Removed a total of 76 redundant transitions.
[2020-05-21 01:02:30] [INFO ] Flatten gal took : 73 ms
[2020-05-21 01:02:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2020-05-21 01:02:30] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 11 ms
[2020-05-21 01:02:30] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 29 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 3 ordering constraints for composite.
built 15 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20754,0.074126,6384,348,25,3771,174,384,4728,49,404,0


Converting to forward existential form...Done !
original formula: EF((EG((((((i7.u31.WantSection_2_T>=1)&&(i5.i1.u8.CS_2>=1))||((i3.u16.WantSection_0_T>=1)&&(i7.u33.CS_0>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i1.u34.CS_1>=1)))&&(((((((((((((i0.i1.u22.TestTurn_2_0>=1)&&(i4.i1.u21.Turn_0_1>=1))||((i5.i1.u8.TestTurn_2_1>=1)&&(i1.u30.Turn_1_0>=1)))||((i4.i1.u21.TestTurn_1_0>=1)&&(i0.i1.u22.Turn_0_2>=1)))||((i7.u33.TestTurn_0_1>=1)&&(i1.u30.Turn_1_1>=1)))||((i0.i1.u22.TestTurn_2_0>=1)&&(i6.u18.Turn_0_0>=1)))||((i1.u9.TestTurn_1_1>=1)&&(i1.u30.Turn_1_0>=1)))||((i4.i1.u21.TestTurn_1_0>=1)&&(i6.u18.Turn_0_0>=1)))||((i5.i1.u8.TestTurn_2_1>=1)&&(i1.u30.Turn_1_1>=1)))||((i6.u18.TestTurn_0_0>=1)&&(i4.i1.u21.Turn_0_1>=1)))||((i6.u18.TestTurn_0_0>=1)&&(i0.i1.u22.Turn_0_2>=1)))||((i1.u9.TestTurn_1_1>=1)&&(i1.u30.Turn_1_2>=1)))||((i7.u33.TestTurn_0_1>=1)&&(i1.u30.Turn_1_2>=1))))) + (EG((((i1.u34.EndTurn_1_1>=1)||(i7.u33.EndTurn_0_1>=1))||(i5.i1.u8.EndTurn_2_1>=1))) * ((((((i5.i1.u27.TestIdentity_2_1_2>=1)||(i0.i0.u4.TestIdentity_2_0_2>=1))||(i4.i0.u3.TestIdentity_1_0_1>=1))||(i2.u10.TestIdentity_0_1_0>=1))||(i3.u13.TestIdentity_1_1_1>=1))||(i6.u0.TestIdentity_0_0_0>=1)))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(((((i7.u31.WantSection_2_T>=1)&&(i5.i1.u8.CS_2>=1))||((i3.u16.WantSection_0_T>=1)&&(i7.u33.CS_0>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i1.u34.CS_1>=1)))&&(((((((((((((i0.i1.u22.TestTurn_2_0>=1)&&(i4.i1.u21.Turn_0_1>=1))||((i5.i1.u8.TestTurn_2_1>=1)&&(i1.u30.Turn_1_0>=1)))||((i4.i1.u21.TestTurn_1_0>=1)&&(i0.i1.u22.Turn_0_2>=1)))||((i7.u33.TestTurn_0_1>=1)&&(i1.u30.Turn_1_1>=1)))||((i0.i1.u22.TestTurn_2_0>=1)&&(i6.u18.Turn_0_0>=1)))||((i1.u9.TestTurn_1_1>=1)&&(i1.u30.Turn_1_0>=1)))||((i4.i1.u21.TestTurn_1_0>=1)&&(i6.u18.Turn_0_0>=1)))||((i5.i1.u8.TestTurn_2_1>=1)&&(i1.u30.Turn_1_1>=1)))||((i6.u18.TestTurn_0_0>=1)&&(i4.i1.u21.Turn_0_1>=1)))||((i6.u18.TestTurn_0_0>=1)&&(i0.i1.u22.Turn_0_2>=1)))||((i1.u9.TestTurn_1_1>=1)&&(i1.u30.Turn_1_2>=1)))||((i7.u33.TestTurn_0_1>=1)&&(i1.u30.Turn_1_2>=1)))))] != FALSE + [FwdG((FwdU(Init,TRUE) * ((((((i5.i1.u27.TestIdentity_2_1_2>=1)||(i0.i0.u4.TestIdentity_2_0_2>=1))||(i4.i0.u3.TestIdentity_1_0_1>=1))||(i2.u10.TestIdentity_0_1_0>=1))||(i3.u13.TestIdentity_1_1_1>=1))||(i6.u0.TestIdentity_0_0_0>=1))),(((i1.u34.EndTurn_1_1>=1)||(i7.u33.EndTurn_0_1>=1))||(i5.i1.u8.EndTurn_2_1>=1)))] != FALSE)
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,0.112131,7092,1,0,4574,182,1245,7177,171,430,12520
FORMULA Peterson-PT-2-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG((((((((((((((i7.u31.WantSection_2_T<1)||(i4.i0.u14.TestAlone_1_0_2<1))&&((i3.u16.WantSection_0_T<1)||(i0.i1.u17.TestAlone_2_0_0<1)))&&((i7.u31.WantSection_2_T<1)||(i3.u19.TestAlone_1_1_2<1)))&&((i7.u31.WantSection_2_T<1)||(i2.u12.TestAlone_0_1_2<1)))&&((i5.i1.u32.WantSection_1_T<1)||(i0.i1.u23.TestAlone_2_0_1<1)))&&((i5.i1.u32.WantSection_1_T<1)||(i2.u24.TestAlone_0_1_1<1)))&&((i5.i1.u32.WantSection_1_T<1)||(i5.i0.u29.TestAlone_2_1_1<1)))&&((i7.u31.WantSection_2_T<1)||(i6.u28.TestAlone_0_0_2<1)))&&((i3.u16.WantSection_0_T<1)||(i4.i1.u20.TestAlone_1_0_0<1)))&&((i3.u16.WantSection_0_T<1)||(i5.i1.u25.TestAlone_2_1_0<1)))&&((i5.i1.u32.WantSection_1_T<1)||(i6.u26.TestAlone_0_0_1<1)))&&((i3.u16.WantSection_0_T<1)||(i1.u9.TestAlone_1_1_0<1))))
=> equivalent forward existential formula: [FwdG(Init,(((((((((((((i7.u31.WantSection_2_T<1)||(i4.i0.u14.TestAlone_1_0_2<1))&&((i3.u16.WantSection_0_T<1)||(i0.i1.u17.TestAlone_2_0_0<1)))&&((i7.u31.WantSection_2_T<1)||(i3.u19.TestAlone_1_1_2<1)))&&((i7.u31.WantSection_2_T<1)||(i2.u12.TestAlone_0_1_2<1)))&&((i5.i1.u32.WantSection_1_T<1)||(i0.i1.u23.TestAlone_2_0_1<1)))&&((i5.i1.u32.WantSection_1_T<1)||(i2.u24.TestAlone_0_1_1<1)))&&((i5.i1.u32.WantSection_1_T<1)||(i5.i0.u29.TestAlone_2_1_1<1)))&&((i7.u31.WantSection_2_T<1)||(i6.u28.TestAlone_0_0_2<1)))&&((i3.u16.WantSection_0_T<1)||(i4.i1.u20.TestAlone_1_0_0<1)))&&((i3.u16.WantSection_0_T<1)||(i5.i1.u25.TestAlone_2_1_0<1)))&&((i5.i1.u32.WantSection_1_T<1)||(i6.u26.TestAlone_0_0_1<1)))&&((i3.u16.WantSection_0_T<1)||(i1.u9.TestAlone_1_1_0<1))))] != FALSE
(forward)formula 1,1,0.623353,27684,1,0,48655,211,1327,69064,176,598,106922
FORMULA Peterson-PT-2-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AG(EF(((((((((((((i6.u28.TestIdentity_0_0_2>=1)||(i0.i1.u17.TestIdentity_2_0_0>=1))||(i5.i0.u29.TestIdentity_2_1_1>=1))||(i4.i0.u14.TestIdentity_1_0_2>=1))||(i2.u24.TestIdentity_0_1_1>=1))||(i0.i1.u23.TestIdentity_2_0_1>=1))||(i5.i1.u25.TestIdentity_2_1_0>=1))||(i1.u9.TestIdentity_1_1_0>=1))||(i3.u19.TestIdentity_1_1_2>=1))||(i6.u26.TestIdentity_0_0_1>=1))||(i4.i1.u20.TestIdentity_1_0_0>=1))||(i2.u12.TestIdentity_0_1_2>=1)))) + E((((((((((((((i7.u31.WantSection_2_F>=1)&&(i4.i0.u14.TestAlone_1_0_2>=1))||((i7.u31.WantSection_2_F>=1)&&(i3.u19.TestAlone_1_1_2>=1)))||((i7.u31.WantSection_2_F>=1)&&(i2.u12.TestAlone_0_1_2>=1)))||((i3.u1.WantSection_0_F>=1)&&(i5.i1.u25.TestAlone_2_1_0>=1)))||((i3.u1.WantSection_0_F>=1)&&(i1.u9.TestAlone_1_1_0>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i5.i0.u29.TestAlone_2_1_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i2.u24.TestAlone_0_1_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i0.i1.u23.TestAlone_2_0_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i6.u26.TestAlone_0_0_1>=1)))||((i7.u31.WantSection_2_F>=1)&&(i6.u28.TestAlone_0_0_2>=1)))||((i4.i1.u20.TestAlone_1_0_0>=1)&&(i3.u1.WantSection_0_F>=1)))||((i3.u1.WantSection_0_F>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1))) U (((i7.u5.EndTurn_0_0>=1)||(i0.i0.u6.EndTurn_2_0>=1))||(i1.u7.EndTurn_1_0>=1))))
=> equivalent forward existential formula: [(FwdU((Init * !(E((((((((((((((i7.u31.WantSection_2_F>=1)&&(i4.i0.u14.TestAlone_1_0_2>=1))||((i7.u31.WantSection_2_F>=1)&&(i3.u19.TestAlone_1_1_2>=1)))||((i7.u31.WantSection_2_F>=1)&&(i2.u12.TestAlone_0_1_2>=1)))||((i3.u1.WantSection_0_F>=1)&&(i5.i1.u25.TestAlone_2_1_0>=1)))||((i3.u1.WantSection_0_F>=1)&&(i1.u9.TestAlone_1_1_0>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i5.i0.u29.TestAlone_2_1_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i2.u24.TestAlone_0_1_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i0.i1.u23.TestAlone_2_0_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i6.u26.TestAlone_0_0_1>=1)))||((i7.u31.WantSection_2_F>=1)&&(i6.u28.TestAlone_0_0_2>=1)))||((i4.i1.u20.TestAlone_1_0_0>=1)&&(i3.u1.WantSection_0_F>=1)))||((i3.u1.WantSection_0_F>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1))) U (((i7.u5.EndTurn_0_0>=1)||(i0.i0.u6.EndTurn_2_0>=1))||(i1.u7.EndTurn_1_0>=1))))),TRUE) * !(E(TRUE U ((((((((((((i6.u28.TestIdentity_0_0_2>=1)||(i0.i1.u17.TestIdentity_2_0_0>=1))||(i5.i0.u29.TestIdentity_2_1_1>=1))||(i4.i0.u14.TestIdentity_1_0_2>=1))||(i2.u24.TestIdentity_0_1_1>=1))||(i0.i1.u23.TestIdentity_2_0_1>=1))||(i5.i1.u25.TestIdentity_2_1_0>=1))||(i1.u9.TestIdentity_1_1_0>=1))||(i3.u19.TestIdentity_1_1_2>=1))||(i6.u26.TestIdentity_0_0_1>=1))||(i4.i1.u20.TestIdentity_1_0_0>=1))||(i2.u12.TestIdentity_0_1_2>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions NotAlone_0_2_0, NotAlone_2_1_0, NotAlone_1_2_0, 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_2_2_1, UpdateTurn_2_0_1, UpdateTurn_0_1_1, UpdateTurn_1_2_0, UpdateTurn_0_2_0, UpdateTurn_0_0_1, BecomeIdle_2, BecomeIdle_1, BecomeIdle_0, i0.i0.EndLoop_2_0, i0.i1.u22.UpdateTurn_2_2_0, i1.UpdateTurn_1_1_1, i1.UpdateTurn_1_0_1, i1.u7.EndLoop_1_0, i4.i1.u21.UpdateTurn_1_1_0, i5.NotAlone_2_1_1, i6.u18.UpdateTurn_0_0_0, i7.u5.EndLoop_0_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/27/123
(forward)formula 2,1,0.79405,30588,1,0,53520,231,2166,76617,229,640,132117
FORMULA Peterson-PT-2-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AF((((((((((((((i7.u31.WantSection_2_T>=1)&&(i4.i0.u14.TestAlone_1_0_2>=1))||((i3.u16.WantSection_0_T>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1)))||((i7.u31.WantSection_2_T>=1)&&(i3.u19.TestAlone_1_1_2>=1)))||((i7.u31.WantSection_2_T>=1)&&(i2.u12.TestAlone_0_1_2>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i0.i1.u23.TestAlone_2_0_1>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i2.u24.TestAlone_0_1_1>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i5.i0.u29.TestAlone_2_1_1>=1)))||((i7.u31.WantSection_2_T>=1)&&(i6.u28.TestAlone_0_0_2>=1)))||((i3.u16.WantSection_0_T>=1)&&(i4.i1.u20.TestAlone_1_0_0>=1)))||((i3.u16.WantSection_0_T>=1)&&(i5.i1.u25.TestAlone_2_1_0>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i6.u26.TestAlone_0_0_1>=1)))||((i3.u16.WantSection_0_T>=1)&&(i1.u9.TestAlone_1_1_0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((((i7.u31.WantSection_2_T>=1)&&(i4.i0.u14.TestAlone_1_0_2>=1))||((i3.u16.WantSection_0_T>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1)))||((i7.u31.WantSection_2_T>=1)&&(i3.u19.TestAlone_1_1_2>=1)))||((i7.u31.WantSection_2_T>=1)&&(i2.u12.TestAlone_0_1_2>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i0.i1.u23.TestAlone_2_0_1>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i2.u24.TestAlone_0_1_1>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i5.i0.u29.TestAlone_2_1_1>=1)))||((i7.u31.WantSection_2_T>=1)&&(i6.u28.TestAlone_0_0_2>=1)))||((i3.u16.WantSection_0_T>=1)&&(i4.i1.u20.TestAlone_1_0_0>=1)))||((i3.u16.WantSection_0_T>=1)&&(i5.i1.u25.TestAlone_2_1_0>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i6.u26.TestAlone_0_0_1>=1)))||((i3.u16.WantSection_0_T>=1)&&(i1.u9.TestAlone_1_1_0>=1)))))] = FALSE
(forward)formula 3,0,0.941523,33756,1,0,58857,231,2248,85337,229,655,156333
FORMULA Peterson-PT-2-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(EF((((((((i4.i1.u21.TestTurn_1_0>=1)&&(i4.i1.u21.Turn_0_1>=1))||((i6.u18.TestTurn_0_0>=1)&&(i6.u18.Turn_0_0>=1)))||((i5.i1.u8.TestTurn_2_1>=1)&&(i1.u30.Turn_1_2>=1)))||((i1.u9.TestTurn_1_1>=1)&&(i1.u30.Turn_1_1>=1)))||((i0.i1.u22.TestTurn_2_0>=1)&&(i0.i1.u22.Turn_0_2>=1)))||((i7.u33.TestTurn_0_1>=1)&&(i1.u30.Turn_1_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i4.i1.u21.TestTurn_1_0>=1)&&(i4.i1.u21.Turn_0_1>=1))||((i6.u18.TestTurn_0_0>=1)&&(i6.u18.Turn_0_0>=1)))||((i5.i1.u8.TestTurn_2_1>=1)&&(i1.u30.Turn_1_2>=1)))||((i1.u9.TestTurn_1_1>=1)&&(i1.u30.Turn_1_1>=1)))||((i0.i1.u22.TestTurn_2_0>=1)&&(i0.i1.u22.Turn_0_2>=1)))||((i7.u33.TestTurn_0_1>=1)&&(i1.u30.Turn_1_0>=1))))))] = FALSE
(forward)formula 4,1,0.954645,34020,1,0,59456,231,2277,86162,231,655,159024
FORMULA Peterson-PT-2-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (EX(((((((EF(((((((((((((i6.u28.TestIdentity_0_0_2>=1)||(i0.i1.u17.TestIdentity_2_0_0>=1))||(i5.i0.u29.TestIdentity_2_1_1>=1))||(i4.i0.u14.TestIdentity_1_0_2>=1))||(i2.u24.TestIdentity_0_1_1>=1))||(i0.i1.u23.TestIdentity_2_0_1>=1))||(i5.i1.u25.TestIdentity_2_1_0>=1))||(i1.u9.TestIdentity_1_1_0>=1))||(i3.u19.TestIdentity_1_1_2>=1))||(i6.u26.TestIdentity_0_0_1>=1))||(i4.i1.u20.TestIdentity_1_0_0>=1))||(i2.u12.TestIdentity_0_1_2>=1))) * ((i5.i1.u15.WantSection_1_F<1)||(i5.i1.u32.Idle_1<1))) * ((i7.u31.WantSection_2_F<1)||(i7.u31.Idle_2<1))) * ((i3.u1.WantSection_0_F<1)||(i3.u16.Idle_0<1))) * ((i5.i1.u15.WantSection_1_F<1)||(i5.i1.u32.Idle_1<1))) * ((i7.u31.WantSection_2_F<1)||(i7.u31.Idle_2<1))) * ((i3.u1.WantSection_0_F<1)||(i3.u16.Idle_0<1)))) + A((((((((((((((((((((i6.u26.BeginLoop_0_0_1<1)&&(i5.i0.u2.BeginLoop_2_1_1<1))&&(i6.u28.BeginLoop_0_0_2<1))&&(i2.u11.BeginLoop_0_1_1<1))&&(i2.u12.BeginLoop_0_1_2<1))&&(i3.u1.BeginLoop_1_1_1<1))&&(i4.i0.u14.BeginLoop_1_0_2<1))&&(i3.u13.BeginLoop_1_1_2<1))&&(i0.i0.u4.BeginLoop_2_0_2<1))&&(i5.i1.u27.BeginLoop_2_1_2<1))&&(i6.u0.BeginLoop_0_0_0<1))&&(i0.i1.u17.BeginLoop_2_0_0<1))&&(i4.i1.u20.BeginLoop_1_0_0<1))&&(i1.u9.BeginLoop_1_1_0<1))&&(i2.u10.BeginLoop_0_1_0<1))&&(i4.i0.u3.BeginLoop_1_0_1<1))&&(i0.i1.u23.BeginLoop_2_0_1<1))&&(i5.i1.u25.BeginLoop_2_1_0<1))||((((((((((((((i7.u31.WantSection_2_F>=1)&&(i4.i0.u14.TestAlone_1_0_2>=1))||((i7.u31.WantSection_2_F>=1)&&(i3.u19.TestAlone_1_1_2>=1)))||((i7.u31.WantSection_2_F>=1)&&(i2.u12.TestAlone_0_1_2>=1)))||((i3.u1.WantSection_0_F>=1)&&(i5.i1.u25.TestAlone_2_1_0>=1)))||((i3.u1.WantSection_0_F>=1)&&(i1.u9.TestAlone_1_1_0>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i5.i0.u29.TestAlone_2_1_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i2.u24.TestAlone_0_1_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i0.i1.u23.TestAlone_2_0_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i6.u26.TestAlone_0_0_1>=1)))||((i7.u31.WantSection_2_F>=1)&&(i6.u28.TestAlone_0_0_2>=1)))||((i4.i1.u20.TestAlone_1_0_0>=1)&&(i3.u1.WantSection_0_F>=1)))||((i3.u1.WantSection_0_F>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1)))&&((((((((((((i6.u0.IsEndLoop_0_0_0>=1)||(i4.i0.u3.IsEndLoop_1_0_0>=1))||(i0.i1.u23.IsEndLoop_2_0_0>=1))||(i2.u11.IsEndLoop_0_1_0>=1))||(i3.u1.IsEndLoop_1_1_0>=1))||(i5.i0.u2.IsEndLoop_2_1_0>=1))||(i6.u28.IsEndLoop_0_0_1>=1))||(i4.i0.u3.IsEndLoop_1_0_1>=1))||(i0.i0.u4.IsEndLoop_2_0_1>=1))||(i2.u12.IsEndLoop_0_1_1>=1))||(i3.u13.IsEndLoop_1_1_1>=1))||(i5.i1.u15.IsEndLoop_2_1_1>=1)))) U ((((((((((((((((((i6.u26.BeginLoop_0_0_1>=1)||(i5.i0.u2.BeginLoop_2_1_1>=1))||(i6.u28.BeginLoop_0_0_2>=1))||(i2.u11.BeginLoop_0_1_1>=1))||(i2.u12.BeginLoop_0_1_2>=1))||(i3.u1.BeginLoop_1_1_1>=1))||(i4.i0.u14.BeginLoop_1_0_2>=1))||(i3.u13.BeginLoop_1_1_2>=1))||(i0.i0.u4.BeginLoop_2_0_2>=1))||(i5.i1.u27.BeginLoop_2_1_2>=1))||(i6.u0.BeginLoop_0_0_0>=1))||(i0.i1.u17.BeginLoop_2_0_0>=1))||(i4.i1.u20.BeginLoop_1_0_0>=1))||(i1.u9.BeginLoop_1_1_0>=1))||(i2.u10.BeginLoop_0_1_0>=1))||(i4.i0.u3.BeginLoop_1_0_1>=1))||(i0.i1.u23.BeginLoop_2_0_1>=1))||(i5.i1.u25.BeginLoop_2_1_0>=1))))
=> equivalent forward existential formula: ([(FwdU(((((((EY(Init) * ((i3.u1.WantSection_0_F<1)||(i3.u16.Idle_0<1))) * ((i7.u31.WantSection_2_F<1)||(i7.u31.Idle_2<1))) * ((i5.i1.u15.WantSection_1_F<1)||(i5.i1.u32.Idle_1<1))) * ((i3.u1.WantSection_0_F<1)||(i3.u16.Idle_0<1))) * ((i7.u31.WantSection_2_F<1)||(i7.u31.Idle_2<1))) * ((i5.i1.u15.WantSection_1_F<1)||(i5.i1.u32.Idle_1<1))),TRUE) * ((((((((((((i6.u28.TestIdentity_0_0_2>=1)||(i0.i1.u17.TestIdentity_2_0_0>=1))||(i5.i0.u29.TestIdentity_2_1_1>=1))||(i4.i0.u14.TestIdentity_1_0_2>=1))||(i2.u24.TestIdentity_0_1_1>=1))||(i0.i1.u23.TestIdentity_2_0_1>=1))||(i5.i1.u25.TestIdentity_2_1_0>=1))||(i1.u9.TestIdentity_1_1_0>=1))||(i3.u19.TestIdentity_1_1_2>=1))||(i6.u26.TestIdentity_0_0_1>=1))||(i4.i1.u20.TestIdentity_1_0_0>=1))||(i2.u12.TestIdentity_0_1_2>=1)))] != FALSE + [((Init * !(EG(!(((((((((((((((((((i6.u26.BeginLoop_0_0_1>=1)||(i5.i0.u2.BeginLoop_2_1_1>=1))||(i6.u28.BeginLoop_0_0_2>=1))||(i2.u11.BeginLoop_0_1_1>=1))||(i2.u12.BeginLoop_0_1_2>=1))||(i3.u1.BeginLoop_1_1_1>=1))||(i4.i0.u14.BeginLoop_1_0_2>=1))||(i3.u13.BeginLoop_1_1_2>=1))||(i0.i0.u4.BeginLoop_2_0_2>=1))||(i5.i1.u27.BeginLoop_2_1_2>=1))||(i6.u0.BeginLoop_0_0_0>=1))||(i0.i1.u17.BeginLoop_2_0_0>=1))||(i4.i1.u20.BeginLoop_1_0_0>=1))||(i1.u9.BeginLoop_1_1_0>=1))||(i2.u10.BeginLoop_0_1_0>=1))||(i4.i0.u3.BeginLoop_1_0_1>=1))||(i0.i1.u23.BeginLoop_2_0_1>=1))||(i5.i1.u25.BeginLoop_2_1_0>=1)))))) * !(E(!(((((((((((((((((((i6.u26.BeginLoop_0_0_1>=1)||(i5.i0.u2.BeginLoop_2_1_1>=1))||(i6.u28.BeginLoop_0_0_2>=1))||(i2.u11.BeginLoop_0_1_1>=1))||(i2.u12.BeginLoop_0_1_2>=1))||(i3.u1.BeginLoop_1_1_1>=1))||(i4.i0.u14.BeginLoop_1_0_2>=1))||(i3.u13.BeginLoop_1_1_2>=1))||(i0.i0.u4.BeginLoop_2_0_2>=1))||(i5.i1.u27.BeginLoop_2_1_2>=1))||(i6.u0.BeginLoop_0_0_0>=1))||(i0.i1.u17.BeginLoop_2_0_0>=1))||(i4.i1.u20.BeginLoop_1_0_0>=1))||(i1.u9.BeginLoop_1_1_0>=1))||(i2.u10.BeginLoop_0_1_0>=1))||(i4.i0.u3.BeginLoop_1_0_1>=1))||(i0.i1.u23.BeginLoop_2_0_1>=1))||(i5.i1.u25.BeginLoop_2_1_0>=1))) U (!((((((((((((((((((((i6.u26.BeginLoop_0_0_1<1)&&(i5.i0.u2.BeginLoop_2_1_1<1))&&(i6.u28.BeginLoop_0_0_2<1))&&(i2.u11.BeginLoop_0_1_1<1))&&(i2.u12.BeginLoop_0_1_2<1))&&(i3.u1.BeginLoop_1_1_1<1))&&(i4.i0.u14.BeginLoop_1_0_2<1))&&(i3.u13.BeginLoop_1_1_2<1))&&(i0.i0.u4.BeginLoop_2_0_2<1))&&(i5.i1.u27.BeginLoop_2_1_2<1))&&(i6.u0.BeginLoop_0_0_0<1))&&(i0.i1.u17.BeginLoop_2_0_0<1))&&(i4.i1.u20.BeginLoop_1_0_0<1))&&(i1.u9.BeginLoop_1_1_0<1))&&(i2.u10.BeginLoop_0_1_0<1))&&(i4.i0.u3.BeginLoop_1_0_1<1))&&(i0.i1.u23.BeginLoop_2_0_1<1))&&(i5.i1.u25.BeginLoop_2_1_0<1))||((((((((((((((i7.u31.WantSection_2_F>=1)&&(i4.i0.u14.TestAlone_1_0_2>=1))||((i7.u31.WantSection_2_F>=1)&&(i3.u19.TestAlone_1_1_2>=1)))||((i7.u31.WantSection_2_F>=1)&&(i2.u12.TestAlone_0_1_2>=1)))||((i3.u1.WantSection_0_F>=1)&&(i5.i1.u25.TestAlone_2_1_0>=1)))||((i3.u1.WantSection_0_F>=1)&&(i1.u9.TestAlone_1_1_0>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i5.i0.u29.TestAlone_2_1_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i2.u24.TestAlone_0_1_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i0.i1.u23.TestAlone_2_0_1>=1)))||((i5.i1.u15.WantSection_1_F>=1)&&(i6.u26.TestAlone_0_0_1>=1)))||((i7.u31.WantSection_2_F>=1)&&(i6.u28.TestAlone_0_0_2>=1)))||((i4.i1.u20.TestAlone_1_0_0>=1)&&(i3.u1.WantSection_0_F>=1)))||((i3.u1.WantSection_0_F>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1)))&&((((((((((((i6.u0.IsEndLoop_0_0_0>=1)||(i4.i0.u3.IsEndLoop_1_0_0>=1))||(i0.i1.u23.IsEndLoop_2_0_0>=1))||(i2.u11.IsEndLoop_0_1_0>=1))||(i3.u1.IsEndLoop_1_1_0>=1))||(i5.i0.u2.IsEndLoop_2_1_0>=1))||(i6.u28.IsEndLoop_0_0_1>=1))||(i4.i0.u3.IsEndLoop_1_0_1>=1))||(i0.i0.u4.IsEndLoop_2_0_1>=1))||(i2.u12.IsEndLoop_0_1_1>=1))||(i3.u13.IsEndLoop_1_1_1>=1))||(i5.i1.u15.IsEndLoop_2_1_1>=1))))) * !(((((((((((((((((((i6.u26.BeginLoop_0_0_1>=1)||(i5.i0.u2.BeginLoop_2_1_1>=1))||(i6.u28.BeginLoop_0_0_2>=1))||(i2.u11.BeginLoop_0_1_1>=1))||(i2.u12.BeginLoop_0_1_2>=1))||(i3.u1.BeginLoop_1_1_1>=1))||(i4.i0.u14.BeginLoop_1_0_2>=1))||(i3.u13.BeginLoop_1_1_2>=1))||(i0.i0.u4.BeginLoop_2_0_2>=1))||(i5.i1.u27.BeginLoop_2_1_2>=1))||(i6.u0.BeginLoop_0_0_0>=1))||(i0.i1.u17.BeginLoop_2_0_0>=1))||(i4.i1.u20.BeginLoop_1_0_0>=1))||(i1.u9.BeginLoop_1_1_0>=1))||(i2.u10.BeginLoop_0_1_0>=1))||(i4.i0.u3.BeginLoop_1_0_1>=1))||(i0.i1.u23.BeginLoop_2_0_1>=1))||(i5.i1.u25.BeginLoop_2_1_0>=1)))))))] != FALSE)
(forward)formula 5,0,1.19538,41412,1,0,74821,256,2606,114119,233,690,195478
FORMULA Peterson-PT-2-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(EF(AX((((((((((((((i7.u31.WantSection_2_T>=1)&&(i4.i0.u14.TestAlone_1_0_2>=1))||((i3.u16.WantSection_0_T>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1)))||((i7.u31.WantSection_2_T>=1)&&(i3.u19.TestAlone_1_1_2>=1)))||((i7.u31.WantSection_2_T>=1)&&(i2.u12.TestAlone_0_1_2>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i0.i1.u23.TestAlone_2_0_1>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i2.u24.TestAlone_0_1_1>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i5.i0.u29.TestAlone_2_1_1>=1)))||((i7.u31.WantSection_2_T>=1)&&(i6.u28.TestAlone_0_0_2>=1)))||((i3.u16.WantSection_0_T>=1)&&(i4.i1.u20.TestAlone_1_0_0>=1)))||((i3.u16.WantSection_0_T>=1)&&(i5.i1.u25.TestAlone_2_1_0>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i6.u26.TestAlone_0_0_1>=1)))||((i3.u16.WantSection_0_T>=1)&&(i1.u9.TestAlone_1_1_0>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((((((((((((((i7.u31.WantSection_2_T>=1)&&(i4.i0.u14.TestAlone_1_0_2>=1))||((i3.u16.WantSection_0_T>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1)))||((i7.u31.WantSection_2_T>=1)&&(i3.u19.TestAlone_1_1_2>=1)))||((i7.u31.WantSection_2_T>=1)&&(i2.u12.TestAlone_0_1_2>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i0.i1.u23.TestAlone_2_0_1>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i2.u24.TestAlone_0_1_1>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i5.i0.u29.TestAlone_2_1_1>=1)))||((i7.u31.WantSection_2_T>=1)&&(i6.u28.TestAlone_0_0_2>=1)))||((i3.u16.WantSection_0_T>=1)&&(i4.i1.u20.TestAlone_1_0_0>=1)))||((i3.u16.WantSection_0_T>=1)&&(i5.i1.u25.TestAlone_2_1_0>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i6.u26.TestAlone_0_0_1>=1)))||((i3.u16.WantSection_0_T>=1)&&(i1.u9.TestAlone_1_1_0>=1)))))))))] = FALSE
(forward)formula 6,1,1.33222,42996,1,0,77893,265,2606,119357,233,699,203784
FORMULA Peterson-PT-2-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !(EF(((((i7.u5.EndTurn_0_0>=1)||(i0.i0.u6.EndTurn_2_0>=1))||(i1.u7.EndTurn_1_0>=1))&&((((i7.u31.WantSection_2_T>=1)&&(i5.i1.u8.CS_2>=1))||((i3.u16.WantSection_0_T>=1)&&(i7.u33.CS_0>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i1.u34.CS_1>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((i7.u5.EndTurn_0_0>=1)||(i0.i0.u6.EndTurn_2_0>=1))||(i1.u7.EndTurn_1_0>=1))&&((((i7.u31.WantSection_2_T>=1)&&(i5.i1.u8.CS_2>=1))||((i3.u16.WantSection_0_T>=1)&&(i7.u33.CS_0>=1)))||((i5.i1.u32.WantSection_1_T>=1)&&(i1.u34.CS_1>=1)))))] = FALSE
(forward)formula 7,0,1.33824,43260,1,0,77936,265,2613,119394,233,699,204238
FORMULA Peterson-PT-2-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF((AG(((i7.u31.WantSection_2_F<1)||(i2.u12.TestAlone_0_1_2<1))) + (AG(((i3.u16.WantSection_0_T>=1)&&(i7.u33.CS_0>=1))) * ((i7.u31.WantSection_2_F<1)||(i6.u28.TestAlone_0_0_2<1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((i7.u31.WantSection_2_F<1)||(i2.u12.TestAlone_0_1_2<1))))) + (!(E(TRUE U !(((i3.u16.WantSection_0_T>=1)&&(i7.u33.CS_0>=1))))) * ((i7.u31.WantSection_2_F<1)||(i6.u28.TestAlone_0_0_2<1))))))] = FALSE
(forward)formula 8,0,1.44537,45108,1,0,82420,270,2620,125519,233,716,216287
FORMULA Peterson-PT-2-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF((((i0.i1.u23.IsEndLoop_2_0_0>=1)&&(i5.i1.u32.WantSection_1_T>=1))&&(i6.u26.TestAlone_0_0_1>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i0.i1.u23.IsEndLoop_2_0_0>=1)&&(i5.i1.u32.WantSection_1_T>=1))&&(i6.u26.TestAlone_0_0_1>=1)))] != FALSE
(forward)formula 9,1,1.46234,45372,1,0,82431,270,2624,125534,233,716,216335
FORMULA Peterson-PT-2-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(EF(((i4.i1.u20.TestIdentity_1_0_0<1)&&((i1.u30.Turn_1_0<1)||(i1.u7.AskForSection_1_1<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.i1.u20.TestIdentity_1_0_0<1)&&((i1.u30.Turn_1_0<1)||(i1.u7.AskForSection_1_1<1))))))] = FALSE
(forward)formula 10,1,1.47568,45372,1,0,83197,270,2629,126543,233,716,218265
FORMULA Peterson-PT-2-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: E(EX((i1.u7.EndTurn_1_0<1)) U AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,EX((i1.u7.EndTurn_1_0<1))) * !(EX(!(FALSE))))] != FALSE
(forward)formula 11,0,1.48218,45636,1,0,83330,270,2629,126801,233,716,218577
FORMULA Peterson-PT-2-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(((i3.u1.WantSection_0_F>=1)&&(i3.u16.Idle_0>=1)) U ((i1.u30.Turn_1_0>=1)&&(i7.u5.AskForSection_0_1>=1)))
=> equivalent forward existential formula: [(FwdU(Init,((i3.u1.WantSection_0_F>=1)&&(i3.u16.Idle_0>=1))) * ((i1.u30.Turn_1_0>=1)&&(i7.u5.AskForSection_0_1>=1)))] != FALSE
(forward)formula 12,0,1.50734,46428,1,0,84657,301,2891,128840,240,814,224375
FORMULA Peterson-PT-2-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(AX(((i1.u9.TestTurn_1_1>=1)&&(i1.u30.Turn_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i1.u9.TestTurn_1_1>=1)&&(i1.u30.Turn_1_1>=1))))))] != FALSE
(forward)formula 13,0,1.5295,46956,1,0,85485,301,2893,129848,240,814,226246
FORMULA Peterson-PT-2-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(((i4.i0.u14.BeginLoop_1_0_2<1)||((i5.i1.u8.TestTurn_2_1>=1)&&(i1.u30.Turn_1_1>=1))) U ((((i0.i0.u6.EndTurn_2_0<1)&&((i5.i1.u15.WantSection_1_F<1)||(i6.u26.TestAlone_0_0_1<1)))&&((i0.i0.u4.TestIdentity_2_0_2>=1)||((i5.i1.u32.WantSection_1_T>=1)&&(i2.u24.TestAlone_0_1_1>=1))))&&((i4.i0.u3.BeginLoop_1_0_1>=1)||((i3.u1.WantSection_0_F>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,((i4.i0.u14.BeginLoop_1_0_2<1)||((i5.i1.u8.TestTurn_2_1>=1)&&(i1.u30.Turn_1_1>=1)))) * ((((i0.i0.u6.EndTurn_2_0<1)&&((i5.i1.u15.WantSection_1_F<1)||(i6.u26.TestAlone_0_0_1<1)))&&((i0.i0.u4.TestIdentity_2_0_2>=1)||((i5.i1.u32.WantSection_1_T>=1)&&(i2.u24.TestAlone_0_1_1>=1))))&&((i4.i0.u3.BeginLoop_1_0_1>=1)||((i3.u1.WantSection_0_F>=1)&&(i0.i1.u17.TestAlone_2_0_0>=1)))))] != FALSE
(forward)formula 14,1,1.6393,50916,1,0,94456,306,2962,140310,240,864,252651
FORMULA Peterson-PT-2-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF(!(EF((i0.i1.u17.TestIdentity_2_0_0<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (i0.i1.u17.TestIdentity_2_0_0<1))))] != FALSE
(forward)formula 15,0,1.65525,51180,1,0,94534,306,2963,140319,240,864,253014
FORMULA Peterson-PT-2-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1590022952296

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="CTLFireability"
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 CTLFireability"
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-158961258000708"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;