About the Execution of ITS-Tools for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 290.615 | 41307.00 | 60323.00 | 186.00 | TTFFTFTFTTFFTTTF | normal |
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-162038143900447.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-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900447
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K 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.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:15 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 159K 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-16-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1620547791216
Running Version 0
[2021-05-09 08:09:53] [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 08:09:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:09:53] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-09 08:09:53] [INFO ] Transformed 638 places.
[2021-05-09 08:09:53] [INFO ] Transformed 578 transitions.
[2021-05-09 08:09:53] [INFO ] Found NUPN structural information;
[2021-05-09 08:09:53] [INFO ] Parsed PT model containing 638 places and 578 transitions in 122 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 15) seen :3
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 570 rows 630 cols
[2021-05-09 08:09:53] [INFO ] Computed 100 place invariants in 50 ms
[2021-05-09 08:09:53] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:09:53] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:09:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:54] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-09 08:09:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:09:54] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:09:54] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2021-05-09 08:09:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:54] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-09 08:09:54] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
[2021-05-09 08:09:55] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:09:55] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:09:55] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 2 ms to minimize.
[2021-05-09 08:09:55] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:09:55] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 12 ms to minimize.
[2021-05-09 08:09:55] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:09:56] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:09:56] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:09:56] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:09:56] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:09:56] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:09:56] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:09:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1951 ms
[2021-05-09 08:09:56] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 50 ms.
[2021-05-09 08:09:59] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 1 ms to minimize.
[2021-05-09 08:09:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-09 08:09:59] [INFO ] [Real]Absence check using 62 positive place invariants in 16 ms returned unsat
[2021-05-09 08:09:59] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2021-05-09 08:09:59] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2021-05-09 08:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:00] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2021-05-09 08:10:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:10:00] [INFO ] [Nat]Absence check using 62 positive place invariants in 29 ms returned sat
[2021-05-09 08:10:00] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2021-05-09 08:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:00] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2021-05-09 08:10:00] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:10:01] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2021-05-09 08:10:01] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:10:01] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:10:01] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:10:01] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:10:01] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:10:02] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 1 ms to minimize.
[2021-05-09 08:10:02] [INFO ] Deduced a trap composed of 143 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:10:02] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:10:02] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2021-05-09 08:10:02] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:10:03] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:10:03] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:10:03] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:10:03] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:10:03] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:10:03] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:10:03] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:10:04] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:10:04] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 5 ms to minimize.
[2021-05-09 08:10:04] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 0 ms to minimize.
[2021-05-09 08:10:04] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 0 ms to minimize.
[2021-05-09 08:10:04] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:10:05] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:10:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-09 08:10:05] [INFO ] [Real]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:10:05] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2021-05-09 08:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:05] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2021-05-09 08:10:05] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:10:05] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:10:05] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:10:06] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:10:06] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:10:06] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:10:06] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:10:06] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:10:06] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2021-05-09 08:10:07] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:10:07] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:10:07] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:10:07] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:10:07] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:10:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1995 ms
[2021-05-09 08:10:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:10:07] [INFO ] [Nat]Absence check using 62 positive place invariants in 29 ms returned sat
[2021-05-09 08:10:07] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:07] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-09 08:10:08] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:10:08] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:10:08] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:10:08] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:10:08] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:10:08] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:10:09] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:10:09] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:10:09] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:10:09] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:10:09] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:10:09] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:10:09] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 3 ms to minimize.
[2021-05-09 08:10:10] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 3 ms to minimize.
[2021-05-09 08:10:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2041 ms
[2021-05-09 08:10:10] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 42 ms.
[2021-05-09 08:10:12] [INFO ] Added : 280 causal constraints over 57 iterations in 2433 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-09 08:10:12] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2021-05-09 08:10:12] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:10:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:12] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-09 08:10:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:10:13] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:10:13] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:13] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-09 08:10:13] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2021-05-09 08:10:13] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 0 ms to minimize.
[2021-05-09 08:10:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 470 ms
[2021-05-09 08:10:13] [INFO ] [Real]Absence check using 62 positive place invariants in 18 ms returned sat
[2021-05-09 08:10:13] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 08:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:14] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-09 08:10:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:10:14] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:10:14] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 29 ms returned sat
[2021-05-09 08:10:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:14] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2021-05-09 08:10:14] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 0 ms to minimize.
[2021-05-09 08:10:14] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 0 ms to minimize.
[2021-05-09 08:10:15] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:10:15] [INFO ] Deduced a trap composed of 145 places in 192 ms of which 0 ms to minimize.
[2021-05-09 08:10:15] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 1 ms to minimize.
[2021-05-09 08:10:15] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:10:15] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 0 ms to minimize.
[2021-05-09 08:10:16] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:10:16] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 0 ms to minimize.
[2021-05-09 08:10:16] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:10:16] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 0 ms to minimize.
[2021-05-09 08:10:16] [INFO ] Deduced a trap composed of 153 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:10:17] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 1 ms to minimize.
[2021-05-09 08:10:17] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:10:17] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:10:17] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 1 ms to minimize.
[2021-05-09 08:10:18] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 0 ms to minimize.
[2021-05-09 08:10:18] [INFO ] Deduced a trap composed of 155 places in 179 ms of which 0 ms to minimize.
[2021-05-09 08:10:18] [INFO ] Deduced a trap composed of 165 places in 181 ms of which 1 ms to minimize.
[2021-05-09 08:10:18] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:10:18] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:10:18] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:10:19] [INFO ] Deduced a trap composed of 154 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:10:19] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 1 ms to minimize.
[2021-05-09 08:10:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-09 08:10:19] [INFO ] [Real]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:10:19] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2021-05-09 08:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:19] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-09 08:10:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:10:19] [INFO ] [Nat]Absence check using 62 positive place invariants in 16 ms returned unsat
[2021-05-09 08:10:20] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned unsat
[2021-05-09 08:10:20] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2021-05-09 08:10:20] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:20] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2021-05-09 08:10:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:10:20] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:10:20] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:20] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2021-05-09 08:10:21] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2021-05-09 08:10:21] [INFO ] Deduced a trap composed of 129 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:10:21] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:10:21] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:10:21] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:10:21] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:10:22] [INFO ] Deduced a trap composed of 145 places in 155 ms of which 0 ms to minimize.
[2021-05-09 08:10:22] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2021-05-09 08:10:22] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:10:22] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:10:22] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:10:22] [INFO ] Deduced a trap composed of 147 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:10:23] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 1 ms to minimize.
[2021-05-09 08:10:23] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 0 ms to minimize.
[2021-05-09 08:10:23] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 1 ms to minimize.
[2021-05-09 08:10:23] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:10:24] [INFO ] Deduced a trap composed of 147 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:10:24] [INFO ] Deduced a trap composed of 153 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:10:24] [INFO ] Deduced a trap composed of 160 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:10:24] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:10:24] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:10:24] [INFO ] Deduced a trap composed of 146 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:10:24] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:10:25] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:10:25] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:10:25] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:10:25] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:10:25] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:10:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-09 08:10:25] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:10:25] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2021-05-09 08:10:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:25] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-09 08:10:26] [INFO ] Deduced a trap composed of 150 places in 185 ms of which 0 ms to minimize.
[2021-05-09 08:10:26] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2021-05-09 08:10:26] [INFO ] Deduced a trap composed of 134 places in 173 ms of which 1 ms to minimize.
[2021-05-09 08:10:26] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:10:26] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:10:27] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2021-05-09 08:10:27] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:10:27] [INFO ] Deduced a trap composed of 155 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:10:27] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:10:27] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:10:27] [INFO ] Deduced a trap composed of 147 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:10:27] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2021-05-09 08:10:28] [INFO ] Deduced a trap composed of 144 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:10:28] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:10:28] [INFO ] Deduced a trap composed of 153 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:10:28] [INFO ] Deduced a trap composed of 161 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:10:28] [INFO ] Deduced a trap composed of 160 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:10:28] [INFO ] Deduced a trap composed of 145 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:10:28] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:10:29] [INFO ] Deduced a trap composed of 152 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:10:29] [INFO ] Deduced a trap composed of 149 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:10:29] [INFO ] Deduced a trap composed of 156 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:10:29] [INFO ] Deduced a trap composed of 146 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:10:29] [INFO ] Deduced a trap composed of 162 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:10:29] [INFO ] Deduced a trap composed of 144 places in 168 ms of which 0 ms to minimize.
[2021-05-09 08:10:30] [INFO ] Deduced a trap composed of 153 places in 170 ms of which 0 ms to minimize.
[2021-05-09 08:10:30] [INFO ] Deduced a trap composed of 157 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:10:30] [INFO ] Deduced a trap composed of 154 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:10:30] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:10:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-05-09 08:10:30] [INFO ] [Real]Absence check using 62 positive place invariants in 18 ms returned sat
[2021-05-09 08:10:30] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 08:10:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:10:30] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-09 08:10:30] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:10:31] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2021-05-09 08:10:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 339 ms
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 21500 steps, including 139 resets, run finished after 85 ms. (steps per millisecond=252 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 19 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 346 edges and 630 vertex of which 4 / 630 are part of one of the 1 SCC in 22 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1287 edges and 627 vertex of which 621 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 621 transition count 427
Reduce places removed 138 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 483 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 282 place count 481 transition count 425
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 282 place count 481 transition count 342
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 181 rules applied. Total rules applied 463 place count 383 transition count 342
Discarding 84 places :
Symmetric choice reduction at 3 with 84 rule applications. Total rules 547 place count 299 transition count 258
Iterating global reduction 3 with 84 rules applied. Total rules applied 631 place count 299 transition count 258
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 631 place count 299 transition count 249
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 652 place count 287 transition count 249
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 838 place count 193 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 840 place count 192 transition count 161
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 843 place count 192 transition count 158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 846 place count 189 transition count 158
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 851 place count 189 transition count 158
Applied a total of 851 rules in 206 ms. Remains 189 /630 variables (removed 441) and now considering 158/570 (removed 412) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/630 places, 158/570 transitions.
[2021-05-09 08:10:31] [INFO ] Flatten gal took : 108 ms
[2021-05-09 08:10:31] [INFO ] Flatten gal took : 40 ms
[2021-05-09 08:10:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13492655950764223038.gal : 30 ms
[2021-05-09 08:10:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7290332203799047226.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/ReachabilityCardinality13492655950764223038.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7290332203799047226.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/ReachabilityCardinality13492655950764223038.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7290332203799047226.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7290332203799047226.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :7 after 17
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :17 after 49
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :49 after 101
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :101 after 299
Invariant property BusinessProcesses-PT-16-ReachabilityFireability-03 does not hold.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-16-ReachabilityFireability-00 is true.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :299 after 3069
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3069 after 7101
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :7101 after 24569
Invariant property BusinessProcesses-PT-16-ReachabilityFireability-07 does not hold.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :24569 after 71225
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :71225 after 122201
Reachability property BusinessProcesses-PT-16-ReachabilityFireability-13 is true.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-16-ReachabilityFireability-11 does not hold.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-11 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 513 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,207737,0.272978,15672,2,6869,20,34190,6,0,914,27410,0
Total reachable state count : 207737
Verifying 5 reachability properties.
Reachability property BusinessProcesses-PT-16-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-16-ReachabilityFireability-00,24,0.274663,15936,2,264,20,34190,7,0,928,27410,0
Invariant property BusinessProcesses-PT-16-ReachabilityFireability-03 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
BusinessProcesses-PT-16-ReachabilityFireability-03,1,0.275664,15936,2,190,20,34190,8,0,945,27410,0
Invariant property BusinessProcesses-PT-16-ReachabilityFireability-07 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
BusinessProcesses-PT-16-ReachabilityFireability-07,216,0.275948,15936,2,519,20,34190,9,0,947,27410,0
Invariant property BusinessProcesses-PT-16-ReachabilityFireability-11 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
BusinessProcesses-PT-16-ReachabilityFireability-11,216,0.276315,15936,2,519,20,34190,10,0,952,27410,0
Reachability property BusinessProcesses-PT-16-ReachabilityFireability-13 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-16-ReachabilityFireability-13,864,0.276584,15936,2,575,20,34190,11,0,954,27410,0
All properties solved without resorting to model-checking.
BK_STOP 1620547832523
--------------------
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-16"
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-16, 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-162038143900447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 '
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 ;