Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 148K May 18 16:42 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-13-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716335716776

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:55:18] [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]
[2024-05-21 23:55:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:55:18] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-21 23:55:18] [INFO ] Transformed 593 places.
[2024-05-21 23:55:18] [INFO ] Transformed 536 transitions.
[2024-05-21 23:55:18] [INFO ] Found NUPN structural information;
[2024-05-21 23:55:18] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (281 resets) in 2981 ms. (13 steps per ms) remains 8/14 properties
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (46 resets) in 458 ms. (87 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (49 resets) in 398 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (50 resets) in 426 ms. (93 steps per ms) remains 8/8 properties
[2024-05-21 23:55:20] [INFO ] Flatten gal took : 431 ms
BEST_FIRST walk for 40004 steps (48 resets) in 370 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (49 resets) in 238 ms. (167 steps per ms) remains 8/8 properties
[2024-05-21 23:55:20] [INFO ] Flatten gal took : 138 ms
BEST_FIRST walk for 40004 steps (44 resets) in 321 ms. (124 steps per ms) remains 6/8 properties
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-21 23:55:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6727324906502329845.gal : 39 ms
[2024-05-21 23:55:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8536624740047487998.prop : 11 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6727324906502329845.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8536624740047487998.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8536624740047487998.prop.
BEST_FIRST walk for 40003 steps (45 resets) in 619 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :28 after 125
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :125 after 247
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :247 after 4.84367e+14
// Phase 1: matrix 528 rows 585 cols
[2024-05-21 23:55:20] [INFO ] Computed 95 invariants in 54 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 372/442 variables, 48/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 372/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/470 variables, 9/499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 28/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 113/583 variables, 36/563 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 113/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/585 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/585 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 528/1113 variables, 585/1265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1113 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1113 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 1265 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1201 ms.
Refiners :[Domain max(s): 585/585 constraints, Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 372/442 variables, 48/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 372/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 24 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:55:22] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 14 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:55:23] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 20/510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 3 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 108 places in 203 ms of which 27 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 40 places in 305 ms of which 3 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 111 places in 204 ms of which 2 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 113 places in 215 ms of which 2 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 27 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 118 places in 189 ms of which 12 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 115 places in 222 ms of which 3 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 119 places in 381 ms of which 5 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 3 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 119 places in 181 ms of which 2 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 122 places in 274 ms of which 7 ms to minimize.
SMT process timed out in 6628ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 272 edges and 585 vertex of which 4 / 585 are part of one of the 1 SCC in 14 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1193 edges and 582 vertex of which 577 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 577 transition count 428
Reduce places removed 95 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 111 rules applied. Total rules applied 208 place count 482 transition count 412
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 224 place count 466 transition count 412
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 224 place count 466 transition count 342
Deduced a syphon composed of 70 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 371 place count 389 transition count 342
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 434 place count 326 transition count 279
Iterating global reduction 3 with 63 rules applied. Total rules applied 497 place count 326 transition count 279
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 497 place count 326 transition count 275
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 507 place count 320 transition count 275
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 649 place count 248 transition count 205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 651 place count 247 transition count 209
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 653 place count 247 transition count 207
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 655 place count 245 transition count 207
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 657 place count 245 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 658 place count 244 transition count 206
Applied a total of 658 rules in 334 ms. Remains 244 /585 variables (removed 341) and now considering 206/528 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 244/585 places, 206/528 transitions.
RANDOM walk for 40000 steps (913 resets) in 1322 ms. (30 steps per ms) remains 5/6 properties
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (185 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (201 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/5 properties
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (183 resets) in 187 ms. (212 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 206 rows 244 cols
[2024-05-21 23:55:28] [INFO ] Computed 80 invariants in 15 ms
[2024-05-21 23:55:28] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/159 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/186 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/236 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/237 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 203/440 variables, 237/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 9/449 variables, 6/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/450 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/450 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 244/244 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/159 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 14 ms to minimize.
[2024-05-21 23:55:29] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/186 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:55:30] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 50/236 variables, 26/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:55:31] [INFO ] Deduced a trap composed of 4 places in 705 ms of which 26 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/237 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 203/440 variables, 237/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:55:32] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/440 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-13-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-13-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 449/450 variables, and 347 constraints, problems are : Problem set: 2 solved, 0 unsolved in 3158 ms.
Refiners :[Positive P Invariants (semi-flows): 52/53 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 243/244 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 21/21 constraints]
After SMT, in 3696ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 13832 ms.

BK_STOP 1716335732235

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-13"
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-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-13, 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 r048-tajo-171620399700550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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