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.r472-tajo-171620399600463.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 ltsminxred
Input is BusinessProcesses-PT-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.8K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 14K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 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 59K 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-02-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717225017370

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:56:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:56:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:56:58] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-01 06:56:59] [INFO ] Transformed 262 places.
[2024-06-01 06:56:59] [INFO ] Transformed 219 transitions.
[2024-06-01 06:56:59] [INFO ] Found NUPN structural information;
[2024-06-01 06:56:59] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (539 resets) in 1113 ms. (35 steps per ms) remains 8/15 properties
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (95 resets) in 549 ms. (72 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (101 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (100 resets) in 626 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (96 resets) in 243 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (109 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (94 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (95 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (108 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
// Phase 1: matrix 204 rows 245 cols
[2024-06-01 06:57:00] [INFO ] Computed 43 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-02-ReachabilityFireability-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-02-ReachabilityFireability-2024-07 is UNSAT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 135/222 variables, 29/117 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 135/252 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 2/254 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/254 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/226 variables, 1/255 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 4/259 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 19/245 variables, 10/269 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 19/288 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem BusinessProcesses-PT-02-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 204/449 variables, 245/533 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 0/533 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/449 variables, 0/533 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 533 constraints, problems are : Problem set: 3 solved, 5 unsolved in 930 ms.
Refiners :[Domain max(s): 245/245 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 144/201 variables, 25/82 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 144/226 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 22 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 3 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 13 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 20/246 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 20/266 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 10/276 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 5/281 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/281 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 22/223 variables, 5/286 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 22/308 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 12 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 4/312 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/312 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 22/245 variables, 13/325 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 22/347 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/245 variables, 4/351 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 2 ms to minimize.
SMT process timed out in 6071ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (complete) has 446 edges and 245 vertex of which 236 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 236 transition count 187
Reduce places removed 14 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 222 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 219 transition count 184
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 35 place count 219 transition count 149
Deduced a syphon composed of 35 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 107 place count 182 transition count 149
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 123 place count 166 transition count 133
Iterating global reduction 3 with 16 rules applied. Total rules applied 139 place count 166 transition count 133
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 189 place count 141 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 140 transition count 107
Applied a total of 190 rules in 72 ms. Remains 140 /245 variables (removed 105) and now considering 107/204 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 140/245 places, 107/204 transitions.
RANDOM walk for 40000 steps (1141 resets) in 943 ms. (42 steps per ms) remains 2/5 properties
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (209 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (200 resets) in 107 ms. (370 steps per ms) remains 1/2 properties
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 107 rows 140 cols
[2024-06-01 06:57:06] [INFO ] Computed 35 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/63 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/92 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/111 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 86/197 variables, 111/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 35/232 variables, 18/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/234 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/247 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/63 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/92 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/111 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/197 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 35/232 variables, 18/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/234 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/234 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 13/247 variables, 11/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/247 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 801ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 18 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 107/107 transitions.
Graph (trivial) has 41 edges and 140 vertex of which 4 / 140 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 307 edges and 137 vertex of which 135 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 135 transition count 88
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 123 transition count 88
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 26 place count 123 transition count 81
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 43 place count 113 transition count 81
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 107 transition count 75
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 107 transition count 75
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 95 place count 86 transition count 56
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 86 transition count 56
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 85 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 85 transition count 55
Applied a total of 98 rules in 38 ms. Remains 85 /140 variables (removed 55) and now considering 55/107 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 85/140 places, 55/107 transitions.
RANDOM walk for 40000 steps (2323 resets) in 477 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (593 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
Probably explored full state space saw : 2025 states, properties seen :0
Probabilistic random walk after 8424 steps, saw 2025 distinct states, run finished after 42 ms. (steps per millisecond=200 ) properties seen :0
Explored full state space saw : 2025 states, properties seen :0
Exhaustive walk after 8424 steps, saw 2025 distinct states, run finished after 28 ms. (steps per millisecond=300 ) properties seen :0
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 9273 ms.
ITS solved all properties within timeout

BK_STOP 1717225028180

--------------------
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 ReachabilityFireability -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-02"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-02, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399600463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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