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-167813690400494.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-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690400494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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-06-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678360481427

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 11:14:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:14:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:14:43] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-09 11:14:43] [INFO ] Transformed 376 places.
[2023-03-09 11:14:43] [INFO ] Transformed 297 transitions.
[2023-03-09 11:14:43] [INFO ] Found NUPN structural information;
[2023-03-09 11:14:43] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 102 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 13) seen :9
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-09 11:14:44] [INFO ] Flatten gal took : 108 ms
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
[2023-03-09 11:14:44] [INFO ] Flatten gal took : 41 ms
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
[2023-03-09 11:14:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7605240992613617417.gal : 58 ms
[2023-03-09 11:14:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16169667446973113100.prop : 2 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/ReachabilityCardinality7605240992613617417.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16169667446973113100.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0

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
Loading property file /tmp/ReachabilityCardinality16169667446973113100.prop.
Running SMT prover for 4 properties.
// Phase 1: matrix 296 rows 375 cols
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :16 after 72
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :72 after 141
[2023-03-09 11:14:44] [INFO ] Computed 81 place invariants in 28 ms
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :141 after 8.61831e+07
[2023-03-09 11:14:45] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 11:14:45] [INFO ] [Nat]Absence check using 42 positive place invariants in 17 ms returned sat
[2023-03-09 11:14:45] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 46 ms returned sat
[2023-03-09 11:14:45] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 11:14:48] [INFO ] Deduced a trap composed of 25 places in 2785 ms of which 13 ms to minimize.
[2023-03-09 11:14:49] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2023-03-09 11:14:52] [INFO ] Deduced a trap composed of 83 places in 2979 ms of which 27 ms to minimize.
[2023-03-09 11:14:52] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
[2023-03-09 11:14:52] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 17 ms to minimize.
[2023-03-09 11:14:52] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 0 ms to minimize.
[2023-03-09 11:14:52] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 0 ms to minimize.
[2023-03-09 11:14:52] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 1 ms to minimize.
[2023-03-09 11:14:52] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 0 ms to minimize.
[2023-03-09 11:14:53] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 1 ms to minimize.
[2023-03-09 11:14:53] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 1 ms to minimize.
[2023-03-09 11:14:53] [INFO ] Deduced a trap composed of 83 places in 251 ms of which 0 ms to minimize.
[2023-03-09 11:14:53] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2023-03-09 11:14:53] [INFO ] Deduced a trap composed of 84 places in 162 ms of which 0 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 0 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 0 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 0 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 0 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 0 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 0 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2023-03-09 11:14:54] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 1 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 0 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 1 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 0 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 0 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 0 ms to minimize.
[2023-03-09 11:14:55] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2023-03-09 11:14:56] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 4 ms to minimize.
[2023-03-09 11:14:56] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 0 ms to minimize.
[2023-03-09 11:14:56] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2023-03-09 11:14:56] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 0 ms to minimize.
[2023-03-09 11:14:56] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
[2023-03-09 11:14:56] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2023-03-09 11:14:56] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 1 ms to minimize.
[2023-03-09 11:14:56] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2023-03-09 11:14:56] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2023-03-09 11:14:57] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2023-03-09 11:14:57] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2023-03-09 11:14:57] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2023-03-09 11:14:57] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 0 ms to minimize.
[2023-03-09 11:14:57] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 0 ms to minimize.
[2023-03-09 11:14:57] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2023-03-09 11:14:57] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 0 ms to minimize.
[2023-03-09 11:14:57] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 2 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 0 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 8 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 0 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 0 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2023-03-09 11:14:58] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2023-03-09 11:14:59] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 0 ms to minimize.
[2023-03-09 11:14:59] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 0 ms to minimize.
[2023-03-09 11:14:59] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2023-03-09 11:14:59] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 0 ms to minimize.
[2023-03-09 11:14:59] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2023-03-09 11:14:59] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2023-03-09 11:14:59] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2023-03-09 11:15:00] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 8 ms to minimize.
[2023-03-09 11:15:00] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 1 ms to minimize.
[2023-03-09 11:15:00] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 0 ms to minimize.
[2023-03-09 11:15:00] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2023-03-09 11:15:00] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2023-03-09 11:15:00] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
[2023-03-09 11:15:00] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2023-03-09 11:15:00] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 1 ms to minimize.
[2023-03-09 11:15:01] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2023-03-09 11:15:01] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2023-03-09 11:15:01] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2023-03-09 11:15:01] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 1 ms to minimize.
[2023-03-09 11:15:01] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 1 ms to minimize.
[2023-03-09 11:15:01] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 0 ms to minimize.
[2023-03-09 11:15:01] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 0 ms to minimize.
[2023-03-09 11:15:01] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 1 ms to minimize.
[2023-03-09 11:15:01] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 0 ms to minimize.
[2023-03-09 11:15:02] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 0 ms to minimize.
[2023-03-09 11:15:02] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 0 ms to minimize.
[2023-03-09 11:15:02] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 0 ms to minimize.
[2023-03-09 11:15:02] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 1 ms to minimize.
[2023-03-09 11:15:02] [INFO ] Deduced a trap composed of 83 places in 213 ms of which 1 ms to minimize.
[2023-03-09 11:15:03] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 0 ms to minimize.
[2023-03-09 11:15:03] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 0 ms to minimize.
[2023-03-09 11:15:03] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 1 ms to minimize.
[2023-03-09 11:15:03] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 0 ms to minimize.
[2023-03-09 11:15:03] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2023-03-09 11:15:04] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 1 ms to minimize.
[2023-03-09 11:15:04] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 1 ms to minimize.
[2023-03-09 11:15:04] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2023-03-09 11:15:04] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 0 ms to minimize.
[2023-03-09 11:15:04] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 0 ms to minimize.
[2023-03-09 11:15:05] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2023-03-09 11:15:05] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2023-03-09 11:15:05] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2023-03-09 11:15:05] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 0 ms to minimize.
[2023-03-09 11:15:05] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 1 ms to minimize.
[2023-03-09 11:15:05] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2023-03-09 11:15:05] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 0 ms to minimize.
[2023-03-09 11:15:05] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2023-03-09 11:15:06] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 0 ms to minimize.
[2023-03-09 11:15:06] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 1 ms to minimize.
[2023-03-09 11:15:06] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 1 ms to minimize.
[2023-03-09 11:15:06] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 0 ms to minimize.
[2023-03-09 11:15:06] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 0 ms to minimize.
[2023-03-09 11:15:06] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2023-03-09 11:15:06] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 0 ms to minimize.
[2023-03-09 11:15:07] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 1 ms to minimize.
[2023-03-09 11:15:08] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-03-09 11:15:08] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 0 ms to minimize.
[2023-03-09 11:15:09] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 1 ms to minimize.
[2023-03-09 11:15:09] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 1 ms to minimize.
[2023-03-09 11:15:09] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 0 ms to minimize.
[2023-03-09 11:15:09] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 0 ms to minimize.
[2023-03-09 11:15:10] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2023-03-09 11:15:10] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 0 ms to minimize.
[2023-03-09 11:15:10] [INFO ] Trap strengthening (SAT) tested/added 124/124 trap constraints in 24154 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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 11:15:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:15:10] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 34 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 166 edges and 375 vertex of which 4 / 375 are part of one of the 1 SCC in 8 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 688 edges and 372 vertex of which 369 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 369 transition count 238
Reduce places removed 52 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 317 transition count 233
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 312 transition count 233
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 117 place count 312 transition count 175
Deduced a syphon composed of 58 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 239 place count 248 transition count 175
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 273 place count 214 transition count 141
Iterating global reduction 3 with 34 rules applied. Total rules applied 307 place count 214 transition count 141
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 411 place count 162 transition count 89
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 162 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 415 place count 160 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 159 transition count 86
Applied a total of 416 rules in 152 ms. Remains 159 /375 variables (removed 216) and now considering 86/296 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 159/375 places, 86/296 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :2
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 159 cols
[2023-03-09 11:15:10] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-09 11:15:10] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:15:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2023-03-09 11:15:10] [INFO ] [Nat]Absence check using 40 positive and 34 generalized place invariants in 7 ms returned sat
[2023-03-09 11:15:10] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:15:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 11:15:10] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 11:15:10] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 14 ms to minimize.
[2023-03-09 11:15:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 79 ms
[2023-03-09 11:15:10] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-09 11:15:10] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
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)
All properties solved without resorting to model-checking.
Total runtime 27228 ms.

BK_STOP 1678360511332

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-06"
export BK_EXAMINATION="ReachabilityCardinality"
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-06, examination is ReachabilityCardinality"
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-167813690400494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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