fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961258000711
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Peterson-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.050 24530.00 45232.00 97.60 TTTTFFFTFTFTTTFT normal

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

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

=== Now, execution of the tool begins

BK_START 1590022917731

[2020-05-21 01:02:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:02:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:02:00] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2020-05-21 01:02:00] [INFO ] Transformed 102 places.
[2020-05-21 01:02:00] [INFO ] Transformed 126 transitions.
[2020-05-21 01:02:00] [INFO ] Parsed PT model containing 102 places and 126 transitions in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 117 ms. (steps per millisecond=85 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1]
FORMULA Peterson-PT-2-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 113 ms. (steps per millisecond=88 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA Peterson-PT-2-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-21 01:02:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-05-21 01:02:01] [INFO ] Computed 11 place invariants in 8 ms
[2020-05-21 01:02:01] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-05-21 01:02:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 14 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 108 ms returned sat
[2020-05-21 01:02:01] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-05-21 01:02:01] [INFO ] [Real]Added 26 Read/Feed constraints in 12 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 35 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 195 ms returned sat
[2020-05-21 01:02:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 8 places in 118 ms
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 29 places in 125 ms
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 42 places in 103 ms
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 11 places in 92 ms
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 26 places in 112 ms
[2020-05-21 01:02:02] [INFO ] Deduced a trap composed of 34 places in 62 ms
[2020-05-21 01:02:03] [INFO ] Deduced a trap composed of 29 places in 96 ms
[2020-05-21 01:02:03] [INFO ] Deduced a trap composed of 29 places in 69 ms
[2020-05-21 01:02:03] [INFO ] Deduced a trap composed of 25 places in 57 ms
[2020-05-21 01:02:03] [INFO ] Deduced a trap composed of 25 places in 50 ms
[2020-05-21 01:02:03] [INFO ] Deduced a trap composed of 15 places in 25 ms
[2020-05-21 01:02:03] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-05-21 01:02:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1239 ms
[2020-05-21 01:02:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-05-21 01:02:03] [INFO ] Added : 93 causal constraints over 20 iterations in 335 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2020-05-21 01:02:03] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-21 01:02:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:03] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-05-21 01:02:03] [INFO ] [Real]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:02:03] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-05-21 01:02:04] [INFO ] Deduced a trap composed of 31 places in 121 ms
[2020-05-21 01:02:04] [INFO ] Deduced a trap composed of 8 places in 106 ms
[2020-05-21 01:02:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 337 ms
[2020-05-21 01:02:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 34 ms returned sat
[2020-05-21 01:02:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:04] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2020-05-21 01:02:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:02:04] [INFO ] Deduced a trap composed of 8 places in 137 ms
[2020-05-21 01:02:04] [INFO ] Deduced a trap composed of 11 places in 192 ms
[2020-05-21 01:02:04] [INFO ] Deduced a trap composed of 22 places in 67 ms
[2020-05-21 01:02:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 450 ms
[2020-05-21 01:02:04] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 30 ms.
[2020-05-21 01:02:05] [INFO ] Added : 117 causal constraints over 24 iterations in 561 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-05-21 01:02:05] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned unsat
[2020-05-21 01:02:05] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-21 01:02:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 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 240 ms returned sat
[2020-05-21 01:02:05] [INFO ] [Real]Added 26 Read/Feed constraints in 3 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 30 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:06] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2020-05-21 01:02:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 22 places in 50 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 22 places in 28 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 29 places in 48 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 10 places in 70 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 12 places in 60 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 45 places in 53 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 8 places in 38 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 42 places in 32 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 28 places in 49 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 42 places in 160 ms
[2020-05-21 01:02:06] [INFO ] Deduced a trap composed of 26 places in 65 ms
[2020-05-21 01:02:07] [INFO ] Deduced a trap composed of 25 places in 92 ms
[2020-05-21 01:02:07] [INFO ] Deduced a trap composed of 12 places in 63 ms
[2020-05-21 01:02:07] [INFO ] Deduced a trap composed of 50 places in 45 ms
[2020-05-21 01:02:07] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1190 ms
[2020-05-21 01:02:07] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-05-21 01:02:07] [INFO ] Added : 117 causal constraints over 24 iterations in 326 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-05-21 01:02:07] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-05-21 01:02:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:07] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-05-21 01:02:07] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:02:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:02:07] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:07] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-05-21 01:02:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-21 01:02:07] [INFO ] Deduced a trap composed of 22 places in 127 ms
[2020-05-21 01:02:08] [INFO ] Deduced a trap composed of 12 places in 231 ms
[2020-05-21 01:02:08] [INFO ] Deduced a trap composed of 26 places in 81 ms
[2020-05-21 01:02:08] [INFO ] Deduced a trap composed of 36 places in 395 ms
[2020-05-21 01:02:09] [INFO ] Deduced a trap composed of 42 places in 375 ms
[2020-05-21 01:02:09] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2020-05-21 01:02:09] [INFO ] Deduced a trap composed of 40 places in 101 ms
[2020-05-21 01:02:09] [INFO ] Deduced a trap composed of 12 places in 41 ms
[2020-05-21 01:02:09] [INFO ] Deduced a trap composed of 26 places in 56 ms
[2020-05-21 01:02:09] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-05-21 01:02:09] [INFO ] Deduced a trap composed of 15 places in 35 ms
[2020-05-21 01:02:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1718 ms
[2020-05-21 01:02:09] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 15 ms.
[2020-05-21 01:02:09] [INFO ] Added : 117 causal constraints over 24 iterations in 372 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-05-21 01:02:09] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned unsat
[2020-05-21 01:02:10] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned unsat
[2020-05-21 01:02:10] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 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 56 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Real]Added 26 Read/Feed constraints in 3 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 7 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:10] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-05-21 01:02:10] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:02:10] [INFO ] Deduced a trap composed of 12 places in 48 ms
[2020-05-21 01:02:10] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-05-21 01:02:10] [INFO ] Deduced a trap composed of 22 places in 62 ms
[2020-05-21 01:02:10] [INFO ] Deduced a trap composed of 10 places in 355 ms
[2020-05-21 01:02:10] [INFO ] Deduced a trap composed of 22 places in 39 ms
[2020-05-21 01:02:10] [INFO ] Deduced a trap composed of 25 places in 53 ms
[2020-05-21 01:02:11] [INFO ] Deduced a trap composed of 8 places in 134 ms
[2020-05-21 01:02:11] [INFO ] Deduced a trap composed of 15 places in 87 ms
[2020-05-21 01:02:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 925 ms
[2020-05-21 01:02:11] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 12 ms.
[2020-05-21 01:02:11] [INFO ] Added : 114 causal constraints over 23 iterations in 422 ms. Result :sat
[2020-05-21 01:02:12] [INFO ] Deduced a trap composed of 12 places in 390 ms
[2020-05-21 01:02:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 437 ms
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-05-21 01:02:12] [INFO ] [Real]Absence check using 8 positive place invariants in 30 ms returned sat
[2020-05-21 01:02:12] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:12] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2020-05-21 01:02:12] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-21 01:02:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-21 01:02:12] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-21 01:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:12] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-05-21 01:02:12] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-21 01:02:12] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2020-05-21 01:02:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2020-05-21 01:02:12] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 14 ms.
[2020-05-21 01:02:13] [INFO ] Added : 116 causal constraints over 24 iterations in 286 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
FORMULA Peterson-PT-2-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 22900 steps, including 593 resets, run finished after 236 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 34500 steps, including 732 resets, run finished after 218 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 26600 steps, including 534 resets, run finished after 84 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 24100 steps, including 505 resets, run finished after 61 ms. (steps per millisecond=395 ) properties seen :[0, 0, 0, 1, 0, 0] could not realise parikh vector
FORMULA Peterson-PT-2-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 24000 steps, including 378 resets, run finished after 66 ms. (steps per millisecond=363 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 17000 steps, including 393 resets, run finished after 38 ms. (steps per millisecond=447 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 71 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 96 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 96 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 92 transition count 116
Applied a total of 20 rules in 74 ms. Remains 92 /102 variables (removed 10) and now considering 116/126 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/102 places, 116/126 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2154 ms. (steps per millisecond=464 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2225 ms. (steps per millisecond=449 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 687 ms. (steps per millisecond=1455 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 664 ms. (steps per millisecond=1506 ) properties seen :[0, 0, 0, 0, 0]
Finished probabilistic random walk after 26478 steps, run visited all 5 properties in 59 ms. (steps per millisecond=448 )
Probabilistic random walk after 26478 steps, saw 6620 distinct states, run finished after 60 ms. (steps per millisecond=441 ) properties seen :[1, 1, 1, 1, 1]
FORMULA Peterson-PT-2-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590022942261

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

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