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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K 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 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 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 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716337336987

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 00:22:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:22:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:22:18] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-05-22 00:22:18] [INFO ] Transformed 717 places.
[2024-05-22 00:22:18] [INFO ] Transformed 642 transitions.
[2024-05-22 00:22:18] [INFO ] Found NUPN structural information;
[2024-05-22 00:22:18] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (212 resets) in 2702 ms. (14 steps per ms) remains 9/15 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:22:19] [INFO ] Flatten gal took : 293 ms
[2024-05-22 00:22:19] [INFO ] Flatten gal took : 83 ms
BEST_FIRST walk for 40004 steps (40 resets) in 547 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (41 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
[2024-05-22 00:22:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7930065254586787025.gal : 45 ms
[2024-05-22 00:22:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1557421872295066813.prop : 4 ms
BEST_FIRST walk for 40002 steps (36 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
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/ReachabilityCardinality7930065254586787025.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1557421872295066813.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (36 resets) in 180 ms. (221 steps per ms) remains 9/9 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (36 resets) in 243 ms. (163 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality1557421872295066813.prop.
BEST_FIRST walk for 40003 steps (39 resets) in 286 ms. (139 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :36 after 92
BEST_FIRST walk for 40004 steps (40 resets) in 1140 ms. (35 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :92 after 181
BEST_FIRST walk for 40002 steps (45 resets) in 241 ms. (165 steps per ms) remains 9/9 properties
// Phase 1: matrix 627 rows 702 cols
[2024-05-22 00:22:20] [INFO ] Computed 114 invariants in 31 ms
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :181 after 5.89807e+13
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 387/583 variables, 66/262 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 387/649 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 2/651 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/651 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 22/605 variables, 7/658 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 22/680 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 0/680 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 97/702 variables, 39/719 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 97/816 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 0/816 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-14 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 627/1329 variables, 702/1518 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1329 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1329 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1329/1329 variables, and 1518 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2114 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 401/551 variables, 61/211 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 401/612 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 2/614 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 23 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:22:23] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:22:24] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/634 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:22:25] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:22:26] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 4 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 130 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/654 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-22 00:22:27] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 6 ms to minimize.
[2024-05-22 00:22:28] [INFO ] Deduced a trap composed of 161 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:22:28] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
SMT process timed out in 7409ms, After SMT, problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (complete) has 1418 edges and 702 vertex of which 693 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 693 transition count 547
Reduce places removed 79 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 92 rules applied. Total rules applied 172 place count 614 transition count 534
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 185 place count 601 transition count 534
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 185 place count 601 transition count 403
Deduced a syphon composed of 131 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 462 place count 455 transition count 403
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 541 place count 376 transition count 324
Iterating global reduction 3 with 79 rules applied. Total rules applied 620 place count 376 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 622 place count 376 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 623 place count 375 transition count 322
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 623 place count 375 transition count 319
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 629 place count 372 transition count 319
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 5 with 172 rules applied. Total rules applied 801 place count 286 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 803 place count 285 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 804 place count 284 transition count 234
Applied a total of 804 rules in 126 ms. Remains 284 /702 variables (removed 418) and now considering 234/627 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 284/702 places, 234/627 transitions.
RANDOM walk for 40000 steps (770 resets) in 819 ms. (48 steps per ms) remains 4/6 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (196 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (178 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (169 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (178 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
// Phase 1: matrix 234 rows 284 cols
[2024-05-22 00:22:28] [INFO ] Computed 91 invariants in 7 ms
[2024-05-22 00:22:28] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 144/212 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/216 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 43/259 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/262 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 233/495 variables, 262/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/518 variables, 22/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/518 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 378 constraints, problems are : Problem set: 0 solved, 4 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 284/284 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 144/212 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:22:29] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 11 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:22:30] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 2 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 2 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:22:31] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/216 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-10 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 43/259 variables, 22/120 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/262 variables, 3/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 233/495 variables, 262/387 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/495 variables, 3/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/495 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/495 variables, 5/396 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:22:32] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/495 variables, 8/404 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/495 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 23/518 variables, 22/426 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 8/434 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/518 variables, 2/436 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:22:33] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 23 (INCLUDED_ONLY) 0/518 variables, 8/444 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/518 variables, 0/444 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/518 variables, 0/444 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 444 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4839 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 284/284 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 63/63 constraints]
After SMT, in 5400ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 187 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=46 )
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 14 ms.
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 15924 ms.

BK_STOP 1716337354295

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-18"
export BK_EXAMINATION="ReachabilityFireability"
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-18, 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 r048-tajo-171620399800591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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