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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 85K 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-05-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716333798626

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:23:19] [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:23:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:23:20] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-21 23:23:20] [INFO ] Transformed 368 places.
[2024-05-21 23:23:20] [INFO ] Transformed 319 transitions.
[2024-05-21 23:23:20] [INFO ] Found NUPN structural information;
[2024-05-21 23:23:20] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
[2024-05-21 23:23:20] [INFO ] Flatten gal took : 112 ms
[2024-05-21 23:23:20] [INFO ] Flatten gal took : 50 ms
[2024-05-21 23:23:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10091913632432289246.gal : 24 ms
[2024-05-21 23:23:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14524137195216458437.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10091913632432289246.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14524137195216458437.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 ...330
Loading property file /tmp/ReachabilityCardinality14524137195216458437.prop.
RANDOM walk for 40000 steps (377 resets) in 2579 ms. (15 steps per ms) remains 9/16 properties
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 20
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :20 after 37
Invariant property BusinessProcesses-PT-05-ReachabilityCardinality-2024-10 does not hold.
Reachability property BusinessProcesses-PT-05-ReachabilityCardinality-2024-08 is true.
Reachability property BusinessProcesses-PT-05-ReachabilityCardinality-2024-02 is true.
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :37 after 7.23387e+06
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :7.23387e+06 after 1.28139e+12
BEST_FIRST walk for 40004 steps (67 resets) in 552 ms. (72 steps per ms) remains 8/9 properties
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (69 resets) in 890 ms. (44 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (66 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (65 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 247 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (67 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (69 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (70 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (77 resets) in 210 ms. (189 steps per ms) remains 8/8 properties
// Phase 1: matrix 318 rows 367 cols
[2024-05-21 23:23:21] [INFO ] Computed 57 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 243/334 variables, 41/132 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 243/375 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 33/367 variables, 16/391 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 33/424 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/424 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 318/685 variables, 367/791 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 0/791 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/685 variables, 0/791 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 791 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1441 ms.
Refiners :[Domain max(s): 367/367 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 250/331 variables, 41/122 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 250/372 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 11 places in 311 ms of which 47 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 3 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 9 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 20/392 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 95 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 9 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 90 places in 186 ms of which 2 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 92 places in 1119 ms of which 2 ms to minimize.
SMT process timed out in 7670ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 155 edges and 367 vertex of which 5 / 367 are part of one of the 1 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 704 edges and 363 vertex of which 360 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 360 transition count 263
Reduce places removed 47 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 57 rules applied. Total rules applied 107 place count 313 transition count 253
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 117 place count 303 transition count 253
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 117 place count 303 transition count 214
Deduced a syphon composed of 39 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 201 place count 258 transition count 214
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 235 place count 224 transition count 180
Iterating global reduction 3 with 34 rules applied. Total rules applied 269 place count 224 transition count 180
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 351 place count 183 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 352 place count 183 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 353 place count 182 transition count 138
Applied a total of 353 rules in 155 ms. Remains 182 /367 variables (removed 185) and now considering 138/318 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 182/367 places, 138/318 transitions.
RANDOM walk for 40000 steps (8 resets) in 758 ms. (52 steps per ms) remains 4/5 properties
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 273 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
// Phase 1: matrix 138 rows 182 cols
[2024-05-21 23:23:30] [INFO ] Computed 50 invariants in 9 ms
[2024-05-21 23:23:30] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/164 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/181 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 138/319 variables, 181/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 234 constraints, problems are : Problem set: 0 solved, 3 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 128/164 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 11 places in 828 ms of which 3 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 6 places in 737 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 7 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 26 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 3 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 37 places in 880 ms of which 1 ms to minimize.
[2024-05-21 23:23:34] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:34] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 1 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 39 places in 766 ms of which 2 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 44 places in 802 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 14 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 5 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 4 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 13/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 4/97 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 17/181 variables, 10/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/109 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 138/319 variables, 181/290 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 2/292 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 2/294 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 2/296 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem BusinessProcesses-PT-05-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 16 (OVERLAPS) 1/320 variables, 1/297 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 2/299 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/320 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 299 constraints, problems are : Problem set: 2 solved, 1 unsolved in 8330 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 63/63 constraints]
After SMT, in 8701ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 16 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 138/138 transitions.
Graph (trivial) has 51 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 181 transition count 125
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 170 transition count 125
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 23 place count 170 transition count 114
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 48 place count 156 transition count 114
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 146 transition count 104
Ensure Unique test removed 1 places
Iterating global reduction 2 with 11 rules applied. Total rules applied 69 place count 145 transition count 104
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 140 place count 109 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 108 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 107 transition count 68
Applied a total of 142 rules in 29 ms. Remains 107 /182 variables (removed 75) and now considering 68/138 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 107/182 places, 68/138 transitions.
RANDOM walk for 15857 steps (358 resets) in 58 ms. (268 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 19244 ms.

BK_STOP 1716333819277

--------------------
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-05"
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-05, 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-171620399600486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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