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.r051-tajo-167813703900328.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-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-tajo-167813703900328
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 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 131K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678998426655

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-10
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202303021504
[2023-03-16 20:27:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-16 20:27:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:27:08] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-16 20:27:08] [INFO ] Transformed 518 places.
[2023-03-16 20:27:08] [INFO ] Transformed 471 transitions.
[2023-03-16 20:27:08] [INFO ] Found NUPN structural information;
[2023-03-16 20:27:08] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 140 ms.
Graph (trivial) has 296 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Structural test allowed to assert that 162 places are NOT stable. Took 12 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
[2023-03-16 20:27:09] [INFO ] Flatten gal took : 74 ms
[2023-03-16 20:27:09] [INFO ] Flatten gal took : 36 ms
[2023-03-16 20:27:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality391881186772520401.gal : 16 ms
[2023-03-16 20:27:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13802439726045178998.prop : 5 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/ReachabilityCardinality391881186772520401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13802439726045178998.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 ...328
Loading property file /tmp/ReachabilityCardinality13802439726045178998.prop.
SDD proceeding with computation,356 properties remain. new max is 4
SDD size :1 after 5
Incomplete random walk after 10000 steps, including 89 resets, run finished after 787 ms. (steps per millisecond=12 ) properties (out of 356) seen :77
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
SDD proceeding with computation,356 properties remain. new max is 8
SDD size :5 after 10
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 279) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 279) seen :0
SDD proceeding with computation,356 properties remain. new max is 16
SDD size :10 after 19
Running SMT prover for 279 properties.
// Phase 1: matrix 464 rows 512 cols
[2023-03-16 20:27:09] [INFO ] Computed 85 place invariants in 32 ms
SDD proceeding with computation,356 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,356 properties remain. new max is 64
SDD size :22 after 197
SDD proceeding with computation,356 properties remain. new max is 128
SDD size :197 after 391
SDD proceeding with computation,356 properties remain. new max is 256
SDD size :391 after 3.84528e+14
[2023-03-16 20:27:12] [INFO ] After 2596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:279
[2023-03-16 20:27:13] [INFO ] [Nat]Absence check using 46 positive place invariants in 15 ms returned sat
[2023-03-16 20:27:14] [INFO ] [Nat]Absence check using 46 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-16 20:27:19] [INFO ] After 3908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :279
[2023-03-16 20:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 20:27:23] [INFO ] After 3651ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :279
[2023-03-16 20:27:23] [INFO ] Deduced a trap composed of 122 places in 162 ms of which 6 ms to minimize.
[2023-03-16 20:27:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-16 20:27:24] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 1 ms to minimize.
[2023-03-16 20:27:24] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 1 ms to minimize.
[2023-03-16 20:27:24] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 0 ms to minimize.
[2023-03-16 20:27:24] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 1 ms to minimize.
[2023-03-16 20:27:24] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2023-03-16 20:27:24] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 1 ms to minimize.
[2023-03-16 20:27:24] [INFO ] Deduced a trap composed of 127 places in 114 ms of which 0 ms to minimize.
[2023-03-16 20:27:25] [INFO ] Deduced a trap composed of 115 places in 100 ms of which 1 ms to minimize.
[2023-03-16 20:27:25] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 1 ms to minimize.
[2023-03-16 20:27:25] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 1 ms to minimize.
[2023-03-16 20:27:25] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 1 ms to minimize.
[2023-03-16 20:27:25] [INFO ] Deduced a trap composed of 120 places in 149 ms of which 0 ms to minimize.
[2023-03-16 20:27:25] [INFO ] Deduced a trap composed of 120 places in 103 ms of which 0 ms to minimize.
[2023-03-16 20:27:25] [INFO ] Deduced a trap composed of 122 places in 100 ms of which 1 ms to minimize.
[2023-03-16 20:27:25] [INFO ] Deduced a trap composed of 120 places in 98 ms of which 1 ms to minimize.
[2023-03-16 20:27:26] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 1 ms to minimize.
[2023-03-16 20:27:26] [INFO ] Deduced a trap composed of 114 places in 98 ms of which 1 ms to minimize.
[2023-03-16 20:27:26] [INFO ] Deduced a trap composed of 110 places in 161 ms of which 0 ms to minimize.
[2023-03-16 20:27:26] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 3 ms to minimize.
[2023-03-16 20:27:26] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 0 ms to minimize.
[2023-03-16 20:27:26] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 1 ms to minimize.
[2023-03-16 20:27:27] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 1 ms to minimize.
[2023-03-16 20:27:27] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 1 ms to minimize.
[2023-03-16 20:27:27] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 0 ms to minimize.
[2023-03-16 20:27:27] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2023-03-16 20:27:27] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 1 ms to minimize.
[2023-03-16 20:27:27] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 1 ms to minimize.
[2023-03-16 20:27:27] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 1 ms to minimize.
[2023-03-16 20:27:28] [INFO ] Deduced a trap composed of 119 places in 141 ms of which 0 ms to minimize.
[2023-03-16 20:27:28] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 1 ms to minimize.
[2023-03-16 20:27:28] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-16 20:27:28] [INFO ] Deduced a trap composed of 127 places in 124 ms of which 1 ms to minimize.
[2023-03-16 20:27:28] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 6 ms to minimize.
[2023-03-16 20:27:28] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 0 ms to minimize.
[2023-03-16 20:27:28] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 0 ms to minimize.
[2023-03-16 20:27:29] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 1 ms to minimize.
[2023-03-16 20:27:29] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2023-03-16 20:27:29] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 1 ms to minimize.
[2023-03-16 20:27:29] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 2 ms to minimize.
[2023-03-16 20:27:29] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-16 20:27:29] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 0 ms to minimize.
[2023-03-16 20:27:30] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 2 ms to minimize.
[2023-03-16 20:27:30] [INFO ] Deduced a trap composed of 116 places in 131 ms of which 1 ms to minimize.
[2023-03-16 20:27:30] [INFO ] Deduced a trap composed of 126 places in 143 ms of which 1 ms to minimize.
[2023-03-16 20:27:30] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2023-03-16 20:27:30] [INFO ] Deduced a trap composed of 127 places in 126 ms of which 0 ms to minimize.
[2023-03-16 20:27:30] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 0 ms to minimize.
[2023-03-16 20:27:31] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 0 ms to minimize.
[2023-03-16 20:27:31] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2023-03-16 20:27:31] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 1 ms to minimize.
[2023-03-16 20:27:31] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 0 ms to minimize.
[2023-03-16 20:27:31] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 1 ms to minimize.
[2023-03-16 20:27:31] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 1 ms to minimize.
[2023-03-16 20:27:31] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2023-03-16 20:27:32] [INFO ] Deduced a trap composed of 136 places in 131 ms of which 13 ms to minimize.
[2023-03-16 20:27:32] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 1 ms to minimize.
[2023-03-16 20:27:32] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 0 ms to minimize.
[2023-03-16 20:27:32] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2023-03-16 20:27:32] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 1 ms to minimize.
[2023-03-16 20:27:32] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2023-03-16 20:27:32] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 0 ms to minimize.
[2023-03-16 20:27:33] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 0 ms to minimize.
[2023-03-16 20:27:33] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2023-03-16 20:27:33] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 2 ms to minimize.
[2023-03-16 20:27:33] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2023-03-16 20:27:33] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 2 ms to minimize.
[2023-03-16 20:27:33] [INFO ] Deduced a trap composed of 109 places in 190 ms of which 4 ms to minimize.
[2023-03-16 20:27:34] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2023-03-16 20:27:34] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 1 ms to minimize.
[2023-03-16 20:27:34] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 1 ms to minimize.
[2023-03-16 20:27:34] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-16 20:27:34] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 1 ms to minimize.
[2023-03-16 20:27:34] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 0 ms to minimize.
[2023-03-16 20:27:35] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 1 ms to minimize.
[2023-03-16 20:27:35] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 1 ms to minimize.
[2023-03-16 20:27:35] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 1 ms to minimize.
[2023-03-16 20:27:35] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 0 ms to minimize.
[2023-03-16 20:27:35] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 1 ms to minimize.
[2023-03-16 20:27:35] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 0 ms to minimize.
[2023-03-16 20:27:36] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 1 ms to minimize.
[2023-03-16 20:27:36] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2023-03-16 20:27:36] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2023-03-16 20:27:36] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 0 ms to minimize.
[2023-03-16 20:27:36] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2023-03-16 20:27:36] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 0 ms to minimize.
[2023-03-16 20:27:37] [INFO ] Deduced a trap composed of 117 places in 161 ms of which 0 ms to minimize.
[2023-03-16 20:27:37] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 1 ms to minimize.
[2023-03-16 20:27:37] [INFO ] Deduced a trap composed of 114 places in 172 ms of which 0 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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-16 20:27:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:27:37] [INFO ] After 25175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:279
Fused 279 Parikh solutions to 275 different solutions.
Parikh walk visited 172 properties in 4325 ms.
Support contains 107 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 464/464 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 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 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 510 transition count 382
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 162 place count 430 transition count 382
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 162 place count 430 transition count 331
Deduced a syphon composed of 51 places in 7 ms
Ensure Unique test removed 8 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 272 place count 371 transition count 331
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 314 place count 329 transition count 289
Iterating global reduction 2 with 42 rules applied. Total rules applied 356 place count 329 transition count 289
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 356 place count 329 transition count 283
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 369 place count 322 transition count 283
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 532 place count 239 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 534 place count 238 transition count 206
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 238 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 538 place count 236 transition count 204
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 539 place count 236 transition count 204
Applied a total of 539 rules in 123 ms. Remains 236 /512 variables (removed 276) and now considering 204/464 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 236/512 places, 204/464 transitions.
Finished random walk after 635 steps, including 18 resets, run visited all 107 properties in 20 ms. (steps per millisecond=31 )
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)
Able to resolve query StableMarking after proving 358 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 33504 ms.

BK_STOP 1678998462383

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r051-tajo-167813703900328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;