Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690500559.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 156K Mar 5 18:22 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-14-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678363248447

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-09 12:00:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 12:00:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:00:50] [INFO ] Load time of PNML (sax parser for PT used): 420 ms
[2023-03-09 12:00:50] [INFO ] Transformed 624 places.
[2023-03-09 12:00:50] [INFO ] Transformed 564 transitions.
[2023-03-09 12:00:50] [INFO ] Found NUPN structural information;
[2023-03-09 12:00:50] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 15 ms
Reduce places removed 8 places and 8 transitions.
[2023-03-09 12:00:51] [INFO ] Flatten gal took : 143 ms
[2023-03-09 12:00:51] [INFO ] Flatten gal took : 90 ms
[2023-03-09 12:00:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17892909920852327915.gal : 36 ms
[2023-03-09 12:00:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4634307473719931510.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17892909920852327915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4634307473719931510.prop' '--nowitness' '--gen-order' 'FOLLOW'

Incomplete random walk after 10000 steps, including 68 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Loading property file /tmp/ReachabilityCardinality4634307473719931510.prop.
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 29
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :29 after 141
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :141 after 279
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-14 is true.
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-10 is true.
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-07 is true.
Invariant property BusinessProcesses-PT-14-ReachabilityFireability-05 does not hold.
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 8 properties.
// Phase 1: matrix 556 rows 616 cols
[2023-03-09 12:00:51] [INFO ] Computed 99 place invariants in 23 ms
[2023-03-09 12:00:52] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2023-03-09 12:00:52] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-09 12:00:52] [INFO ] After 220ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-09 12:00:52] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 8 ms to minimize.
[2023-03-09 12:00:53] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2023-03-09 12:00:53] [INFO ] Deduced a trap composed of 109 places in 161 ms of which 1 ms to minimize.
[2023-03-09 12:00:53] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2023-03-09 12:00:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 876 ms
[2023-03-09 12:00:53] [INFO ] After 1128ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 12:00:53] [INFO ] After 1521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 12:00:53] [INFO ] [Nat]Absence check using 60 positive place invariants in 17 ms returned sat
[2023-03-09 12:00:53] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2023-03-09 12:00:54] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-09 12:00:54] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2023-03-09 12:00:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-09 12:00:54] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 0 ms to minimize.
[2023-03-09 12:00:55] [INFO ] Deduced a trap composed of 113 places in 224 ms of which 1 ms to minimize.
[2023-03-09 12:00:55] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 1 ms to minimize.
[2023-03-09 12:00:55] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2023-03-09 12:00:55] [INFO ] Deduced a trap composed of 107 places in 178 ms of which 1 ms to minimize.
[2023-03-09 12:00:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1296 ms
[2023-03-09 12:00:56] [INFO ] Deduced a trap composed of 151 places in 168 ms of which 1 ms to minimize.
[2023-03-09 12:00:56] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 1 ms to minimize.
[2023-03-09 12:00:56] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 0 ms to minimize.
[2023-03-09 12:00:56] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:00:56] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 0 ms to minimize.
[2023-03-09 12:00:57] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:00:57] [INFO ] Deduced a trap composed of 144 places in 123 ms of which 0 ms to minimize.
[2023-03-09 12:00:57] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 0 ms to minimize.
[2023-03-09 12:00:57] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2023-03-09 12:00:57] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2023-03-09 12:00:57] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2023-03-09 12:00:57] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-09 12:00:58] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2023-03-09 12:00:58] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 0 ms to minimize.
[2023-03-09 12:00:58] [INFO ] Deduced a trap composed of 154 places in 135 ms of which 0 ms to minimize.
[2023-03-09 12:00:58] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2023-03-09 12:00:58] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 1 ms to minimize.
[2023-03-09 12:00:58] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 0 ms to minimize.
[2023-03-09 12:00:59] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:00:59] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 0 ms to minimize.
[2023-03-09 12:00:59] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 0 ms to minimize.
[2023-03-09 12:00:59] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 0 ms to minimize.
[2023-03-09 12:00:59] [INFO ] Deduced a trap composed of 150 places in 125 ms of which 0 ms to minimize.
[2023-03-09 12:00:59] [INFO ] Deduced a trap composed of 136 places in 128 ms of which 5 ms to minimize.
[2023-03-09 12:00:59] [INFO ] Deduced a trap composed of 151 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:01:00] [INFO ] Deduced a trap composed of 150 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:01:00] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:01:00] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 1 ms to minimize.
[2023-03-09 12:01:00] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 0 ms to minimize.
[2023-03-09 12:01:00] [INFO ] Deduced a trap composed of 149 places in 122 ms of which 2 ms to minimize.
[2023-03-09 12:01:00] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 0 ms to minimize.
[2023-03-09 12:01:00] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2023-03-09 12:01:01] [INFO ] Deduced a trap composed of 148 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:01:01] [INFO ] Deduced a trap composed of 141 places in 131 ms of which 0 ms to minimize.
[2023-03-09 12:01:01] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:01:01] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2023-03-09 12:01:01] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:01:01] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-09 12:01:01] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 1 ms to minimize.
[2023-03-09 12:01:02] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:01:02] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:01:02] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 0 ms to minimize.
[2023-03-09 12:01:02] [INFO ] Deduced a trap composed of 142 places in 117 ms of which 1 ms to minimize.
[2023-03-09 12:01:02] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 0 ms to minimize.
[2023-03-09 12:01:02] [INFO ] Deduced a trap composed of 144 places in 119 ms of which 1 ms to minimize.
[2023-03-09 12:01:02] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 12 ms to minimize.
[2023-03-09 12:01:03] [INFO ] Deduced a trap composed of 137 places in 111 ms of which 1 ms to minimize.
[2023-03-09 12:01:03] [INFO ] Deduced a trap composed of 139 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:01:03] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2023-03-09 12:01:03] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 0 ms to minimize.
[2023-03-09 12:01:03] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2023-03-09 12:01:04] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2023-03-09 12:01:04] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:01:04] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 1 ms to minimize.
[2023-03-09 12:01:04] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:01:04] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 1 ms to minimize.
[2023-03-09 12:01:04] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 0 ms to minimize.
[2023-03-09 12:01:05] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 0 ms to minimize.
[2023-03-09 12:01:05] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:01:05] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 0 ms to minimize.
[2023-03-09 12:01:05] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 1 ms to minimize.
[2023-03-09 12:01:05] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2023-03-09 12:01:05] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 0 ms to minimize.
[2023-03-09 12:01:06] [INFO ] Deduced a trap composed of 139 places in 115 ms of which 0 ms to minimize.
[2023-03-09 12:01:06] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 1 ms to minimize.
[2023-03-09 12:01:06] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:01:06] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 0 ms to minimize.
[2023-03-09 12:01:06] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2023-03-09 12:01:06] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:01:06] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 0 ms to minimize.
[2023-03-09 12:01:07] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 15 ms to minimize.
[2023-03-09 12:01:07] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 0 ms to minimize.
[2023-03-09 12:01:07] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 0 ms to minimize.
[2023-03-09 12:01:07] [INFO ] Deduced a trap composed of 144 places in 181 ms of which 1 ms to minimize.
[2023-03-09 12:01:08] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 0 ms to minimize.
[2023-03-09 12:01:08] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 1 ms to minimize.
[2023-03-09 12:01:08] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 0 ms to minimize.
[2023-03-09 12:01:08] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 1 ms to minimize.
[2023-03-09 12:01:08] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:01:09] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 1 ms to minimize.
[2023-03-09 12:01:09] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 0 ms to minimize.
[2023-03-09 12:01:09] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2023-03-09 12:01:09] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2023-03-09 12:01:09] [INFO ] Deduced a trap composed of 153 places in 121 ms of which 0 ms to minimize.
[2023-03-09 12:01:09] [INFO ] Deduced a trap composed of 151 places in 143 ms of which 0 ms to minimize.
[2023-03-09 12:01:10] [INFO ] Deduced a trap composed of 150 places in 161 ms of which 0 ms to minimize.
[2023-03-09 12:01:10] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 0 ms to minimize.
[2023-03-09 12:01:10] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:01:10] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2023-03-09 12:01:10] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 1 ms to minimize.
[2023-03-09 12:01:10] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 1 ms to minimize.
[2023-03-09 12:01:11] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 1 ms to minimize.
[2023-03-09 12:01:11] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 0 ms to minimize.
[2023-03-09 12:01:11] [INFO ] Deduced a trap composed of 132 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:01:11] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 0 ms to minimize.
[2023-03-09 12:01:11] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 0 ms to minimize.
[2023-03-09 12:01:11] [INFO ] Deduced a trap composed of 145 places in 114 ms of which 0 ms to minimize.
[2023-03-09 12:01:11] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 1 ms to minimize.
[2023-03-09 12:01:12] [INFO ] Deduced a trap composed of 138 places in 132 ms of which 0 ms to minimize.
[2023-03-09 12:01:12] [INFO ] Deduced a trap composed of 134 places in 213 ms of which 1 ms to minimize.
[2023-03-09 12:01:12] [INFO ] Deduced a trap composed of 134 places in 225 ms of which 1 ms to minimize.
[2023-03-09 12:01:12] [INFO ] Deduced a trap composed of 136 places in 204 ms of which 1 ms to minimize.
[2023-03-09 12:01:13] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 1 ms to minimize.
[2023-03-09 12:01:13] [INFO ] Deduced a trap composed of 132 places in 257 ms of which 1 ms to minimize.
[2023-03-09 12:01:13] [INFO ] Deduced a trap composed of 135 places in 220 ms of which 1 ms to minimize.
[2023-03-09 12:01:13] [INFO ] Deduced a trap composed of 132 places in 206 ms of which 1 ms to minimize.
[2023-03-09 12:01:14] [INFO ] Deduced a trap composed of 136 places in 229 ms of which 0 ms to minimize.
[2023-03-09 12:01:14] [INFO ] Deduced a trap composed of 130 places in 206 ms of which 1 ms to minimize.
[2023-03-09 12:01:14] [INFO ] Deduced a trap composed of 133 places in 208 ms of which 1 ms to minimize.
[2023-03-09 12:01:14] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 1 ms to minimize.
[2023-03-09 12:01:14] [INFO ] Deduced a trap composed of 131 places in 204 ms of which 1 ms to minimize.
[2023-03-09 12:01:15] [INFO ] Deduced a trap composed of 132 places in 210 ms of which 1 ms to minimize.
[2023-03-09 12:01:15] [INFO ] Deduced a trap composed of 135 places in 204 ms of which 2 ms to minimize.
[2023-03-09 12:01:15] [INFO ] Deduced a trap composed of 143 places in 258 ms of which 1 ms to minimize.
[2023-03-09 12:01:15] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 1 ms to minimize.
[2023-03-09 12:01:16] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 1 ms to minimize.
[2023-03-09 12:01:16] [INFO ] Deduced a trap composed of 135 places in 203 ms of which 0 ms to minimize.
[2023-03-09 12:01:16] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 1 ms to minimize.
[2023-03-09 12:01:16] [INFO ] Deduced a trap composed of 143 places in 205 ms of which 1 ms to minimize.
[2023-03-09 12:01:17] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 1 ms to minimize.
[2023-03-09 12:01:17] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 1 ms to minimize.
[2023-03-09 12:01:17] [INFO ] Deduced a trap composed of 135 places in 199 ms of which 1 ms to minimize.
[2023-03-09 12:01:17] [INFO ] Deduced a trap composed of 133 places in 212 ms of which 1 ms to minimize.
[2023-03-09 12:01:17] [INFO ] Deduced a trap composed of 135 places in 213 ms of which 1 ms to minimize.
[2023-03-09 12:01:18] [INFO ] Deduced a trap composed of 147 places in 200 ms of which 1 ms to minimize.
[2023-03-09 12:01:18] [INFO ] Deduced a trap composed of 139 places in 199 ms of which 1 ms to minimize.
[2023-03-09 12:01:18] [INFO ] Deduced a trap composed of 132 places in 233 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 12:01:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 12:01:18] [INFO ] After 25150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 67 ms.
Support contains 46 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 610 transition count 474
Reduce places removed 81 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 88 rules applied. Total rules applied 170 place count 529 transition count 467
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 177 place count 522 transition count 467
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 177 place count 522 transition count 345
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 434 place count 387 transition count 345
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 511 place count 310 transition count 268
Iterating global reduction 3 with 77 rules applied. Total rules applied 588 place count 310 transition count 268
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 588 place count 310 transition count 261
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 605 place count 300 transition count 261
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 763 place count 220 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 764 place count 220 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 765 place count 219 transition count 182
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 770 place count 219 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 771 place count 218 transition count 181
Applied a total of 771 rules in 165 ms. Remains 218 /616 variables (removed 398) and now considering 181/556 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 218/616 places, 181/556 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1021461 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 1021461 steps, saw 191992 distinct states, run finished after 3003 ms. (steps per millisecond=340 ) properties seen :4
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 181 rows 218 cols
[2023-03-09 12:01:22] [INFO ] Computed 76 place invariants in 16 ms
[2023-03-09 12:01:22] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:01:22] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2023-03-09 12:01:22] [INFO ] [Nat]Absence check using 56 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-09 12:01:22] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:01:22] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-09 12:01:23] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 181/181 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 218 transition count 179
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 216 transition count 179
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 214 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 214 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 213 transition count 176
Applied a total of 10 rules in 38 ms. Remains 213 /218 variables (removed 5) and now considering 176/181 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 213/218 places, 176/181 transitions.
Incomplete random walk after 10000 steps, including 262 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1122574 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :{}
Probabilistic random walk after 1122574 steps, saw 210827 distinct states, run finished after 3005 ms. (steps per millisecond=373 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 213 cols
[2023-03-09 12:01:26] [INFO ] Computed 76 place invariants in 5 ms
[2023-03-09 12:01:26] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:01:26] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2023-03-09 12:01:26] [INFO ] [Nat]Absence check using 56 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-09 12:01:26] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:01:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 12:01:26] [INFO ] After 114ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 12:01:26] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-09 12:01:26] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 213 /213 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 213/213 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 213 /213 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-09 12:01:26] [INFO ] Invariant cache hit.
[2023-03-09 12:01:33] [INFO ] Implicit Places using invariants in 6084 ms returned [26, 27, 49, 51, 53, 55, 57, 59, 61, 63, 185]
Discarding 11 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 6087 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/213 places, 174/176 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 198 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 198 transition count 161
Applied a total of 8 rules in 11 ms. Remains 198 /202 variables (removed 4) and now considering 161/174 (removed 13) transitions.
// Phase 1: matrix 161 rows 198 cols
[2023-03-09 12:01:33] [INFO ] Computed 67 place invariants in 5 ms
[2023-03-09 12:01:33] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-09 12:01:33] [INFO ] Invariant cache hit.
[2023-03-09 12:01:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 12:01:33] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [103, 105, 112, 114, 118, 119, 130, 132, 135, 136, 138]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 363 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 187/213 places, 161/176 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 187 transition count 158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 184 transition count 158
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 178 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 152
Applied a total of 19 rules in 15 ms. Remains 177 /187 variables (removed 10) and now considering 152/161 (removed 9) transitions.
// Phase 1: matrix 152 rows 177 cols
[2023-03-09 12:01:33] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-09 12:01:33] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 12:01:33] [INFO ] Invariant cache hit.
[2023-03-09 12:01:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 12:01:33] [INFO ] Implicit Places using invariants and state equation in 199 ms returned [15, 18, 23, 24, 25, 26, 29, 30, 34]
Discarding 9 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 289 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 168/213 places, 150/176 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 167 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 167 transition count 146
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 167 transition count 146
Applied a total of 7 rules in 13 ms. Remains 167 /168 variables (removed 1) and now considering 146/150 (removed 4) transitions.
// Phase 1: matrix 146 rows 167 cols
[2023-03-09 12:01:33] [INFO ] Computed 48 place invariants in 4 ms
[2023-03-09 12:01:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 12:01:33] [INFO ] Invariant cache hit.
[2023-03-09 12:01:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 12:01:33] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 167/213 places, 146/176 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 7038 ms. Remains : 167/213 places, 146/176 transitions.
Incomplete random walk after 10000 steps, including 289 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2196321 steps, run timeout after 3001 ms. (steps per millisecond=731 ) properties seen :{}
Probabilistic random walk after 2196321 steps, saw 367797 distinct states, run finished after 3002 ms. (steps per millisecond=731 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 12:01:37] [INFO ] Invariant cache hit.
[2023-03-09 12:01:37] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:01:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 12:01:37] [INFO ] [Nat]Absence check using 36 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-09 12:01:37] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:01:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 12:01:37] [INFO ] After 45ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 12:01:37] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-09 12:01:37] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 146/146 transitions.
Applied a total of 0 rules in 10 ms. Remains 167 /167 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 167/167 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 146/146 transitions.
Applied a total of 0 rules in 9 ms. Remains 167 /167 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2023-03-09 12:01:37] [INFO ] Invariant cache hit.
[2023-03-09 12:01:37] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 12:01:37] [INFO ] Invariant cache hit.
[2023-03-09 12:01:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 12:01:37] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-09 12:01:37] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 12:01:37] [INFO ] Invariant cache hit.
[2023-03-09 12:01:37] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 167/167 places, 146/146 transitions.
Graph (complete) has 482 edges and 167 vertex of which 165 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 164 transition count 145
Applied a total of 3 rules in 5 ms. Remains 164 /167 variables (removed 3) and now considering 145/146 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 164 cols
[2023-03-09 12:01:37] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-09 12:01:37] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:01:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-09 12:01:37] [INFO ] [Nat]Absence check using 34 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-09 12:01:37] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:01:37] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2023-03-09 12:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-09 12:01:38] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-09 12:01:38] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 12:01:38] [INFO ] Flatten gal took : 11 ms
[2023-03-09 12:01:38] [INFO ] Flatten gal took : 9 ms
[2023-03-09 12:01:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11805288817288463553.gal : 2 ms
[2023-03-09 12:01:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15085156713930930693.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11805288817288463553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15085156713930930693.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15085156713930930693.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 78
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :78 after 488
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :488 after 804
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :804 after 1188
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1188 after 16548
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-09 is true.
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,331488,0.175836,11552,2,3367,14,31498,6,0,795,19937,0
Total reachable state count : 331488

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-09 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-14-ReachabilityFireability-09,96,0.439914,11808,2,245,14,31498,7,0,883,19937,0
ITS tools runner thread asked to quit. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 12:01:38] [INFO ] Flatten gal took : 22 ms
[2023-03-09 12:01:38] [INFO ] Applying decomposition
[2023-03-09 12:01:38] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9395999350947826525.txt' '-o' '/tmp/graph9395999350947826525.bin' '-w' '/tmp/graph9395999350947826525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9395999350947826525.bin' '-l' '-1' '-v' '-w' '/tmp/graph9395999350947826525.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:01:38] [INFO ] Decomposing Gal with order
[2023-03-09 12:01:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:01:38] [INFO ] Removed a total of 278 redundant transitions.
[2023-03-09 12:01:38] [INFO ] Flatten gal took : 97 ms
[2023-03-09 12:01:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2023-03-09 12:01:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9023520802372366503.gal : 11 ms
[2023-03-09 12:01:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14937887237312598877.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9023520802372366503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14937887237312598877.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14937887237312598877.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 11019
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :11019 after 18461
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.63314e+18 after 4.04268e+20
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.04268e+20 after 1.38147e+23
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,5.18497e+26,42.1058,753416,44066,85,1.12756e+06,1322,1462,3.53538e+06,101,3046,0
Total reachable state count : 518497079994221217202569216

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-09 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-14-ReachabilityFireability-09,1.49162e+17,43.0717,753416,560,25,1.12756e+06,1322,1568,3.53538e+06,109,3046,140649
All properties solved without resorting to model-checking.
Total runtime 92159 ms.

BK_STOP 1678363342736

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-14"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, 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 r037-tajo-167813690500559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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