Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143700335.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143700335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K 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 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 59K 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 BusinessProcesses-PT-02-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620542467877

Running Version 0
[2021-05-09 06:41:10] [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-09 06:41:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:41:10] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-09 06:41:10] [INFO ] Transformed 262 places.
[2021-05-09 06:41:10] [INFO ] Transformed 219 transitions.
[2021-05-09 06:41:10] [INFO ] Found NUPN structural information;
[2021-05-09 06:41:10] [INFO ] Parsed PT model containing 262 places and 219 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 133 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 15) seen :7
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 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 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 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 21 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 204 rows 245 cols
[2021-05-09 06:41:10] [INFO ] Computed 43 place invariants in 20 ms
[2021-05-09 06:41:10] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2021-05-09 06:41:10] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:10] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-09 06:41:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2021-05-09 06:41:10] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:10] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-09 06:41:10] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 5 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 0 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 0 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:41:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 702 ms
[2021-05-09 06:41:11] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 14 ms.
[2021-05-09 06:41:11] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 0 ms to minimize.
[2021-05-09 06:41:12] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:41:12] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:41:12] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2021-05-09 06:41:12] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:41:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 312 ms
[2021-05-09 06:41:12] [INFO ] Added : 127 causal constraints over 27 iterations in 677 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-09 06:41:12] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2021-05-09 06:41:12] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:12] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-09 06:41:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 06:41:12] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:41:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:12] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-09 06:41:12] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2021-05-09 06:41:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2021-05-09 06:41:12] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2021-05-09 06:41:12] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-09 06:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:12] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-09 06:41:12] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2021-05-09 06:41:12] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2021-05-09 06:41:12] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2021-05-09 06:41:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 117 ms
[2021-05-09 06:41:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 06:41:12] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:41:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:12] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-09 06:41:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 129 ms
[2021-05-09 06:41:13] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2021-05-09 06:41:13] [INFO ] Added : 111 causal constraints over 23 iterations in 274 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-09 06:41:13] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned unsat
[2021-05-09 06:41:13] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2021-05-09 06:41:13] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:41:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:13] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 27 places in 20 ms of which 0 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2021-05-09 06:41:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 3 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 24 places in 18 ms of which 1 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 451 ms
[2021-05-09 06:41:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 06:41:14] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:41:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:14] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 0 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 1 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Deduced a trap composed of 24 places in 17 ms of which 1 ms to minimize.
[2021-05-09 06:41:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 449 ms
[2021-05-09 06:41:14] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 13 ms.
[2021-05-09 06:41:14] [INFO ] Added : 123 causal constraints over 25 iterations in 283 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-09 06:41:14] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 06:41:14] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:14] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 9 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 60 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 2 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 60 places in 33 ms of which 0 ms to minimize.
[2021-05-09 06:41:15] [INFO ] Deduced a trap composed of 30 places in 18 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 58 places in 35 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 62 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 59 places in 35 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 59 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 62 places in 36 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 58 places in 35 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 58 places in 32 ms of which 1 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 62 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 63 places in 31 ms of which 1 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 61 places in 28 ms of which 1 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 59 places in 28 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 57 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 60 places in 28 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 57 places in 32 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 62 places in 29 ms of which 1 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 65 places in 32 ms of which 0 ms to minimize.
[2021-05-09 06:41:16] [INFO ] Deduced a trap composed of 59 places in 32 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 2010 ms
[2021-05-09 06:41:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 06:41:17] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:17] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 60 places in 36 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:41:17] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
[2021-05-09 06:41:18] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:41:18] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 0 ms to minimize.
[2021-05-09 06:41:18] [INFO ] Deduced a trap composed of 30 places in 20 ms of which 0 ms to minimize.
[2021-05-09 06:41:18] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1000 ms
[2021-05-09 06:41:18] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 10 ms.
[2021-05-09 06:41:18] [INFO ] Added : 135 causal constraints over 27 iterations in 376 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-09 06:41:18] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
[2021-05-09 06:41:18] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 06:41:18] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:18] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-09 06:41:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned unsat
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 13000 steps, including 195 resets, run finished after 28 ms. (steps per millisecond=464 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12200 steps, including 204 resets, run finished after 26 ms. (steps per millisecond=469 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13500 steps, including 210 resets, run finished after 23 ms. (steps per millisecond=586 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14700 steps, including 224 resets, run finished after 29 ms. (steps per millisecond=506 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 14 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 124 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 438 edges and 239 vertex of which 227 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 227 transition count 146
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 184 transition count 143
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 181 transition count 143
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 95 place count 181 transition count 109
Deduced a syphon composed of 34 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 169 place count 141 transition count 109
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 194 place count 116 transition count 84
Iterating global reduction 3 with 25 rules applied. Total rules applied 219 place count 116 transition count 84
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 291 place count 79 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 292 place count 79 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 293 place count 78 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 294 place count 78 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 295 place count 77 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 296 place count 76 transition count 47
Applied a total of 296 rules in 69 ms. Remains 76 /245 variables (removed 169) and now considering 47/204 (removed 157) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/245 places, 47/204 transitions.
[2021-05-09 06:41:19] [INFO ] Flatten gal took : 29 ms
[2021-05-09 06:41:19] [INFO ] Flatten gal took : 7 ms
[2021-05-09 06:41:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3664337456596756365.gal : 5 ms
[2021-05-09 06:41:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14813191670750356973.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/ReachabilityCardinality3664337456596756365.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14813191670750356973.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/ReachabilityCardinality3664337456596756365.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14813191670750356973.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14813191670750356973.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :64 after 132
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-03 is true.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-00 is true.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :132 after 236
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-10 is true.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :236 after 297
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-11 is true.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 TRUE 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 33 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,492,0.026911,4532,2,860,16,3001,6,0,351,1829,0
Total reachable state count : 492

Verifying 4 reachability properties.
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-02-ReachabilityFireability-00,6,0.028046,4532,2,87,16,3001,7,0,378,1829,0
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-02-ReachabilityFireability-03,1,0.028516,4796,2,77,16,3001,8,0,385,1829,0
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-02-ReachabilityFireability-10,1,0.028838,4796,2,77,16,3001,9,0,387,1829,0
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-02-ReachabilityFireability-11,6,0.029087,4796,2,108,16,3001,10,0,389,1829,0
All properties solved without resorting to model-checking.

BK_STOP 1620542479379

--------------------
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="BusinessProcesses-PT-02"
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 BusinessProcesses-PT-02, 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 r026-tajo-162038143700335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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