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.r071-tall-162039088600038.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 DES-PT-05b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-tall-162039088600038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 73K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1620477696136

Running Version 0
[2021-05-08 12:41:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2021-05-08 12:41:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 12:41:38] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-08 12:41:38] [INFO ] Transformed 300 places.
[2021-05-08 12:41:38] [INFO ] Transformed 251 transitions.
[2021-05-08 12:41:38] [INFO ] Found NUPN structural information;
[2021-05-08 12:41:38] [INFO ] Parsed PT model containing 300 places and 251 transitions in 105 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 8 ms.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 213) seen :203
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 251 rows 300 cols
[2021-05-08 12:41:38] [INFO ] Computed 65 place invariants in 27 ms
[2021-05-08 12:41:38] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-08 12:41:38] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 9 ms returned sat
[2021-05-08 12:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:38] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2021-05-08 12:41:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:41:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-08 12:41:38] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 12:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:38] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-08 12:41:38] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2021-05-08 12:41:38] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 3 ms to minimize.
[2021-05-08 12:41:39] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2021-05-08 12:41:39] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 2 ms to minimize.
[2021-05-08 12:41:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 389 ms
[2021-05-08 12:41:39] [INFO ] Computed and/alt/rep : 249/451/249 causal constraints (skipped 1 transitions) in 23 ms.
[2021-05-08 12:41:40] [INFO ] Added : 242 causal constraints over 49 iterations in 971 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-08 12:41:40] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-08 12:41:40] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 12:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:40] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-08 12:41:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:41:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2021-05-08 12:41:40] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 12:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:40] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-08 12:41:40] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2021-05-08 12:41:40] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2021-05-08 12:41:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2021-05-08 12:41:40] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2021-05-08 12:41:40] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2021-05-08 12:41:40] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2021-05-08 12:41:40] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2021-05-08 12:41:41] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2021-05-08 12:41:41] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2021-05-08 12:41:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 575 ms
[2021-05-08 12:41:41] [INFO ] Computed and/alt/rep : 249/451/249 causal constraints (skipped 1 transitions) in 14 ms.
[2021-05-08 12:41:42] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2021-05-08 12:41:42] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2021-05-08 12:41:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2021-05-08 12:41:42] [INFO ] Added : 239 causal constraints over 49 iterations in 1154 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 12:41:42] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-08 12:41:42] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 12:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:42] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-08 12:41:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:41:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2021-05-08 12:41:42] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 12:41:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:42] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-08 12:41:42] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2021-05-08 12:41:42] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2021-05-08 12:41:42] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2021-05-08 12:41:42] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2021-05-08 12:41:42] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2021-05-08 12:41:42] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2021-05-08 12:41:42] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2021-05-08 12:41:43] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2021-05-08 12:41:43] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2021-05-08 12:41:43] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2021-05-08 12:41:43] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2021-05-08 12:41:43] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2021-05-08 12:41:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 725 ms
[2021-05-08 12:41:43] [INFO ] Computed and/alt/rep : 249/451/249 causal constraints (skipped 1 transitions) in 13 ms.
[2021-05-08 12:41:44] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2021-05-08 12:41:44] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2021-05-08 12:41:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2021-05-08 12:41:44] [INFO ] Added : 239 causal constraints over 49 iterations in 1103 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 12:41:44] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-08 12:41:44] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 12:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:44] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-08 12:41:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:41:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2021-05-08 12:41:44] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 9 ms returned sat
[2021-05-08 12:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:44] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-08 12:41:44] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2021-05-08 12:41:44] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2021-05-08 12:41:44] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 4 ms to minimize.
[2021-05-08 12:41:44] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2021-05-08 12:41:45] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2021-05-08 12:41:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2021-05-08 12:41:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2021-05-08 12:41:45] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2021-05-08 12:41:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 451 ms
[2021-05-08 12:41:45] [INFO ] Computed and/alt/rep : 249/451/249 causal constraints (skipped 1 transitions) in 13 ms.
[2021-05-08 12:41:46] [INFO ] Added : 238 causal constraints over 48 iterations in 899 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-08 12:41:46] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-08 12:41:46] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 12:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:46] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-08 12:41:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:41:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-08 12:41:46] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 8 ms returned sat
[2021-05-08 12:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:46] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-08 12:41:46] [INFO ] Computed and/alt/rep : 249/451/249 causal constraints (skipped 1 transitions) in 13 ms.
[2021-05-08 12:41:47] [INFO ] Added : 238 causal constraints over 49 iterations in 975 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-08 12:41:47] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2021-05-08 12:41:47] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 12:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:47] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-08 12:41:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:41:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-08 12:41:47] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 6 ms returned sat
[2021-05-08 12:41:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:47] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-08 12:41:47] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2021-05-08 12:41:47] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2021-05-08 12:41:47] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2021-05-08 12:41:47] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2021-05-08 12:41:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 263 ms
[2021-05-08 12:41:47] [INFO ] Computed and/alt/rep : 249/451/249 causal constraints (skipped 1 transitions) in 12 ms.
[2021-05-08 12:41:48] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2021-05-08 12:41:48] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2021-05-08 12:41:48] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
[2021-05-08 12:41:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 184 ms
[2021-05-08 12:41:49] [INFO ] Added : 240 causal constraints over 48 iterations in 1088 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 12:41:49] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-08 12:41:49] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 12:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:49] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-08 12:41:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:41:49] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2021-05-08 12:41:49] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2021-05-08 12:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:41:49] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-08 12:41:49] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2021-05-08 12:41:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-08 12:41:49] [INFO ] Computed and/alt/rep : 249/451/249 causal constraints (skipped 1 transitions) in 16 ms.
[2021-05-08 12:41:50] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2021-05-08 12:41:50] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2021-05-08 12:41:50] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2021-05-08 12:41:50] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2021-05-08 12:41:50] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2021-05-08 12:41:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 389 ms
[2021-05-08 12:41:50] [INFO ] Added : 238 causal constraints over 48 iterations in 1318 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 96200 steps, including 1114 resets, run finished after 362 ms. (steps per millisecond=265 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 95400 steps, including 1078 resets, run finished after 314 ms. (steps per millisecond=303 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 70900 steps, including 707 resets, run finished after 232 ms. (steps per millisecond=305 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 59600 steps, including 635 resets, run finished after 192 ms. (steps per millisecond=310 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 64500 steps, including 710 resets, run finished after 207 ms. (steps per millisecond=311 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 95300 steps, including 1152 resets, run finished after 295 ms. (steps per millisecond=323 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 79400 steps, including 1177 resets, run finished after 237 ms. (steps per millisecond=335 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 7 out of 300 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 300/300 places, 251/251 transitions.
Graph (complete) has 561 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 294 transition count 224
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 273 transition count 224
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 273 transition count 215
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 264 transition count 215
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 245 transition count 196
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 245 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 245 transition count 195
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 244 transition count 195
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 229 transition count 180
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 229 transition count 180
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 229 transition count 165
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 227 transition count 164
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 227 transition count 161
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 224 transition count 161
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 147 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 145 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 145 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 144 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 143 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 142 transition count 84
Applied a total of 319 rules in 114 ms. Remains 142 /300 variables (removed 158) and now considering 84/251 (removed 167) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/300 places, 84/251 transitions.
[2021-05-08 12:41:52] [INFO ] Flatten gal took : 42 ms
[2021-05-08 12:41:52] [INFO ] Flatten gal took : 14 ms
[2021-05-08 12:41:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11235663634619537102.gal : 8 ms
[2021-05-08 12:41:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11300997057009861414.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/ReachabilityCardinality11235663634619537102.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11300997057009861414.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/ReachabilityCardinality11235663634619537102.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11300997057009861414.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11300997057009861414.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :4 after 44
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :44 after 156
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :156 after 1624
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :1624 after 6304
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :34360 after 41948
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :41948 after 148632
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :148632 after 9.06564e+07
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :9.06564e+07 after 3.8024e+08
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :3.8024e+08 after 8.75155e+08
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :8.75155e+08 after 1.24308e+09
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :1.24308e+09 after 2.62295e+09
Invariant property smplace_9 does not hold.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :2.62295e+09 after 1.41994e+10
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :1.41994e+10 after 4.27577e+10
Detected timeout of ITS tools.
[2021-05-08 12:42:08] [INFO ] Flatten gal took : 16 ms
[2021-05-08 12:42:08] [INFO ] Applying decomposition
[2021-05-08 12:42:08] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph328545606427870561.txt, -o, /tmp/graph328545606427870561.bin, -w, /tmp/graph328545606427870561.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph328545606427870561.bin, -l, -1, -v, -w, /tmp/graph328545606427870561.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:42:08] [INFO ] Decomposing Gal with order
[2021-05-08 12:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:42:08] [INFO ] Removed a total of 42 redundant transitions.
[2021-05-08 12:42:08] [INFO ] Flatten gal took : 37 ms
[2021-05-08 12:42:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2021-05-08 12:42:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3932220379491506463.gal : 4 ms
[2021-05-08 12:42:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7565542988622544779.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3932220379491506463.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7565542988622544779.prop, --nowitness], 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/ReachabilityCardinality3932220379491506463.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7565542988622544779.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7565542988622544779.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 1924
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1924 after 48952
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :48952 after 8.695e+08
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\_mod\_flat,3.12935e+11,0.239537,12592,2140,259,23317,572,294,18236,108,1714,0
Total reachable state count : 312934736872

Verifying 6 reachability properties.
Invariant property smplace_2 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
smplace\_2,1392,0.241064,12592,85,40,23317,572,296,18236,111,1714,0
Invariant property smplace_6 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
smplace\_6,2.4703e+06,0.241609,12592,379,106,23317,572,298,18236,113,1714,0
Invariant property smplace_7 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
smplace\_7,1.60985e+10,0.242248,12592,856,128,23317,572,300,18236,115,1714,0
Invariant property smplace_8 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
smplace\_8,4.71014e+10,0.243164,12592,1165,138,23317,572,302,18236,117,1714,0
Invariant property smplace_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
smplace\_12,5.47138e+09,0.243774,12592,755,118,23317,572,303,18236,117,1714,0
Invariant property smplace_13 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
smplace\_13,4.51401e+08,0.244246,12592,415,91,23317,572,304,18236,117,1714,0
Able to resolve query StableMarking after proving 214 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL USE_NUPN

BK_STOP 1620477729826

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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="DES-PT-05b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DES-PT-05b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-tall-162039088600038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;