Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200615.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200615
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 555K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 464K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 253K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621019756062

Running Version 0
[2021-05-14 19:15:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 19:15:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:15:57] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-14 19:15:57] [INFO ] Transformed 244 places.
[2021-05-14 19:15:57] [INFO ] Transformed 332 transitions.
[2021-05-14 19:15:57] [INFO ] Found NUPN structural information;
[2021-05-14 19:15:57] [INFO ] Parsed PT model containing 244 places and 332 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 15) seen :6
FORMULA Peterson-PT-3-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :2
FORMULA Peterson-PT-3-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2021-05-14 19:15:58] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:15:58] [INFO ] Computed 15 place invariants in 20 ms
[2021-05-14 19:15:58] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-14 19:15:58] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 94 ms returned unsat
[2021-05-14 19:15:58] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:15:58] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:58] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-14 19:15:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:15:58] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:15:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 19:15:58] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:15:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:58] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-14 19:15:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 19:15:58] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 4 ms to minimize.
[2021-05-14 19:15:58] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 0 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 0 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:16:00] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2010 ms
[2021-05-14 19:16:00] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 22 ms.
[2021-05-14 19:16:01] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:16:01] [INFO ] Deduced a trap composed of 52 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:16:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2021-05-14 19:16:02] [INFO ] Added : 248 causal constraints over 52 iterations in 1293 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-14 19:16:02] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:16:02] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Real]Added 66 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:16:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:16:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:16:02] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Nat]Added 66 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 0 ms to minimize.
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 4 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 0 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 57 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:16:03] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1634 ms
[2021-05-14 19:16:03] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 19 ms.
[2021-05-14 19:16:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:16:05] [INFO ] Deduced a trap composed of 52 places in 24 ms of which 1 ms to minimize.
[2021-05-14 19:16:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2021-05-14 19:16:05] [INFO ] Added : 248 causal constraints over 52 iterations in 1153 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-14 19:16:05] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:16:05] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:16:05] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2021-05-14 19:16:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:16:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 19:16:05] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned unsat
[2021-05-14 19:16:05] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2021-05-14 19:16:05] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:16:05] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:16:05] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-14 19:16:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:16:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:16:05] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:16:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:16:05] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-14 19:16:05] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:16:05] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2021-05-14 19:16:05] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:16:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2021-05-14 19:16:05] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 16 ms.
[2021-05-14 19:16:06] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2021-05-14 19:16:06] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:16:06] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 8 ms to minimize.
[2021-05-14 19:16:06] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2021-05-14 19:16:06] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2021-05-14 19:16:06] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2021-05-14 19:16:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 455 ms
[2021-05-14 19:16:07] [INFO ] Added : 253 causal constraints over 51 iterations in 1321 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-14 19:16:07] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 19:16:07] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:16:07] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-14 19:16:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:16:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:16:07] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:16:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-14 19:16:07] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:16:07] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2021-05-14 19:16:07] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:16:07] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:16:07] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2021-05-14 19:16:07] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:16:07] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2021-05-14 19:16:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2021-05-14 19:16:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 408 ms
[2021-05-14 19:16:07] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 16 ms.
[2021-05-14 19:16:08] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 10 ms to minimize.
[2021-05-14 19:16:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2021-05-14 19:16:08] [INFO ] Added : 250 causal constraints over 51 iterations in 1021 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
FORMULA Peterson-PT-3-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 41500 steps, including 886 resets, run finished after 147 ms. (steps per millisecond=282 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA Peterson-PT-3-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 65100 steps, including 944 resets, run finished after 168 ms. (steps per millisecond=387 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 59300 steps, including 824 resets, run finished after 173 ms. (steps per millisecond=342 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 17 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 244 transition count 247
Reduce places removed 85 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 88 rules applied. Total rules applied 173 place count 159 transition count 244
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 176 place count 156 transition count 244
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 176 place count 156 transition count 199
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 266 place count 111 transition count 199
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 286 place count 101 transition count 189
Applied a total of 286 rules in 43 ms. Remains 101 /244 variables (removed 143) and now considering 189/332 (removed 143) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/244 places, 189/332 transitions.
[2021-05-14 19:16:09] [INFO ] Flatten gal took : 44 ms
[2021-05-14 19:16:09] [INFO ] Flatten gal took : 16 ms
[2021-05-14 19:16:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality583489696277104777.gal : 9 ms
[2021-05-14 19:16:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13628811264340182882.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality583489696277104777.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13628811264340182882.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality583489696277104777.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13628811264340182882.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13628811264340182882.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 21
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :21 after 34
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 48
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :48 after 306
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :306 after 463
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :463 after 1004
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1004 after 4052
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4052 after 11161
Invariant property Peterson-PT-3-ReachabilityFireability-15 does not hold.
FORMULA Peterson-PT-3-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :11161 after 23100
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :23100 after 42830
Invariant property Peterson-PT-3-ReachabilityFireability-12 does not hold.
FORMULA Peterson-PT-3-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,83474,1.68119,42508,2,11947,19,127645,6,0,596,133761,0
Total reachable state count : 83474

Verifying 2 reachability properties.
Invariant property Peterson-PT-3-ReachabilityFireability-12 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-3-ReachabilityFireability-12,139,1.84151,42508,2,684,19,127645,7,0,613,133761,0
Invariant property Peterson-PT-3-ReachabilityFireability-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-3-ReachabilityFireability-15,28,2.04632,42508,2,179,19,127645,8,0,641,133761,0
All properties solved without resorting to model-checking.

BK_STOP 1621019772421

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-3"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-3, 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 r140-tall-162089128200615"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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