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.r047-tajo-171620398600606.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 greatspnxred
Input is BusinessProcesses-PT-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398600606
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 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 192K 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-20-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716309464585

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:37:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:37:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:37:46] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-21 16:37:46] [INFO ] Transformed 782 places.
[2024-05-21 16:37:46] [INFO ] Transformed 697 transitions.
[2024-05-21 16:37:46] [INFO ] Found NUPN structural information;
[2024-05-21 16:37:46] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 21 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (199 resets) in 1575 ms. (25 steps per ms) remains 3/10 properties
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (37 resets) in 268 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (30 resets) in 289 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (38 resets) in 484 ms. (82 steps per ms) remains 3/3 properties
// Phase 1: matrix 638 rows 719 cols
[2024-05-21 16:37:48] [INFO ] Computed 121 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 485/559 variables, 71/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/559 variables, 485/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 34/593 variables, 7/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 34/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/593 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 125/718 variables, 42/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/718 variables, 125/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/718 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/719 variables, 1/839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 638/1357 variables, 719/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 1559 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1744 ms.
Refiners :[Domain max(s): 719/719 constraints, Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 719/719 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/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 485/559 variables, 71/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/559 variables, 485/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 42 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 4 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 14 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 11 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 3 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 4 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 3 ms to minimize.
[2024-05-21 16:37:52] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 16 ms to minimize.
[2024-05-21 16:37:52] [INFO ] Deduced a trap composed of 132 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:37:52] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 6 ms to minimize.
[2024-05-21 16:38:02] [INFO ] Deduced a trap composed of 150 places in 10007 ms of which 3 ms to minimize.
SMT process timed out in 14620ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 339 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 686 transition count 488
Reduce places removed 129 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 144 rules applied. Total rules applied 275 place count 557 transition count 473
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 290 place count 542 transition count 473
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 290 place count 542 transition count 385
Deduced a syphon composed of 88 places in 13 ms
Ensure Unique test removed 14 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 480 place count 440 transition count 385
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 548 place count 372 transition count 317
Iterating global reduction 3 with 68 rules applied. Total rules applied 616 place count 372 transition count 317
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 616 place count 372 transition count 313
Deduced a syphon composed of 4 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 625 place count 367 transition count 313
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 817 place count 270 transition count 218
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 819 place count 270 transition count 216
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 821 place count 268 transition count 216
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 823 place count 268 transition count 216
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 824 place count 267 transition count 215
Applied a total of 824 rules in 354 ms. Remains 267 /719 variables (removed 452) and now considering 215/638 (removed 423) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 267/719 places, 215/638 transitions.
RANDOM walk for 40000 steps (1375 resets) in 708 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (310 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (316 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (330 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 764138 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :1 out of 3
Probabilistic random walk after 764138 steps, saw 124781 distinct states, run finished after 3005 ms. (steps per millisecond=254 ) properties seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-21 16:38:06] [INFO ] Flow matrix only has 214 transitions (discarded 1 similar events)
// Phase 1: matrix 214 rows 267 cols
[2024-05-21 16:38:06] [INFO ] Computed 90 invariants in 4 ms
[2024-05-21 16:38:06] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/117 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/195 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/246 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/247 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 211/458 variables, 247/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 23/481 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/481 variables, 8/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/481 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/481 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 361 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1398 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 267/267 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/117 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 78/195 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 51/246 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 12 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 1 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 1 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/247 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 211/458 variables, 247/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/458 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 23/481 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/481 variables, 8/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/481 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:38:10] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/481 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:38:10] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/481 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/481 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:38:10] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/481 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/481 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/481 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2675 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 267/267 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints]
After SMT, in 4105ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 291 ms.
Support contains 30 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 215/215 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 267 transition count 209
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 261 transition count 209
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 12 place count 261 transition count 192
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 52 place count 238 transition count 192
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 233 transition count 187
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 233 transition count 187
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 217 transition count 171
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 217 transition count 168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 100 place count 214 transition count 168
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 214 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 213 transition count 167
Applied a total of 103 rules in 48 ms. Remains 213 /267 variables (removed 54) and now considering 167/215 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 213/267 places, 167/215 transitions.
RANDOM walk for 40000 steps (815 resets) in 346 ms. (115 steps per ms) remains 1/2 properties
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (99 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
[2024-05-21 16:38:11] [INFO ] Flow matrix only has 166 transitions (discarded 1 similar events)
// Phase 1: matrix 166 rows 213 cols
[2024-05-21 16:38:11] [INFO ] Computed 84 invariants in 17 ms
[2024-05-21 16:38:11] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/103 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/164 variables, 39/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/194 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/195 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 165/360 variables, 195/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/378 variables, 17/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 8/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/379 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/379 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/379 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 213/213 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/103 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/164 variables, 39/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/194 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 4 ms to minimize.
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:38:11] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:38:12] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:38:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/195 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 165/360 variables, 195/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 6/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/378 variables, 17/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/378 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/378 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:38:12] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/378 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/378 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/379 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/379 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/379 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 319 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 213/213 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 1379ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4417 steps, including 116 resets, run visited all 1 properties in 18 ms. (steps per millisecond=245 )
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 24 ms.
All properties solved without resorting to model-checking.
Total runtime 26038 ms.
ITS solved all properties within timeout

BK_STOP 1716309492588

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-20, 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 r047-tajo-171620398600606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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