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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716333820052

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 23:23:41] [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-21 23:23:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:23:41] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-21 23:23:41] [INFO ] Transformed 368 places.
[2024-05-21 23:23:41] [INFO ] Transformed 319 transitions.
[2024-05-21 23:23:41] [INFO ] Found NUPN structural information;
[2024-05-21 23:23:41] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 1 transitions.
RANDOM walk for 40000 steps (363 resets) in 1888 ms. (21 steps per ms) remains 9/16 properties
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (68 resets) in 369 ms. (108 steps per ms) remains 9/9 properties
[2024-05-21 23:23:42] [INFO ] Flatten gal took : 236 ms
[2024-05-21 23:23:42] [INFO ] Flatten gal took : 50 ms
[2024-05-21 23:23:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14474094798234668274.gal : 22 ms
[2024-05-21 23:23:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4291604671152079797.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14474094798234668274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4291604671152079797.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (72 resets) in 308 ms. (129 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 ...329
Loading property file /tmp/ReachabilityCardinality4291604671152079797.prop.
BEST_FIRST walk for 40003 steps (69 resets) in 324 ms. (123 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 20
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :20 after 37
BEST_FIRST walk for 40002 steps (65 resets) in 224 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (78 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (66 resets) in 279 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (66 resets) in 245 ms. (162 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (69 resets) in 88 ms. (449 steps per ms) remains 8/9 properties
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (72 resets) in 520 ms. (76 steps per ms) remains 8/8 properties
// Phase 1: matrix 318 rows 367 cols
[2024-05-21 23:23:43] [INFO ] Computed 57 invariants in 42 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 182/338 variables, 39/195 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 182/377 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 2/379 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/379 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/345 variables, 2/381 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 7/388 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 22/367 variables, 14/402 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 22/424 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/424 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 318/685 variables, 367/791 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 0/791 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/685 variables, 0/791 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 791 constraints, problems are : Problem set: 4 solved, 4 unsolved in 4186 ms.
Refiners :[Domain max(s): 367/367 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 231/319 variables, 37/125 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 231/356 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 23:23:48] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 16 ms to minimize.
[2024-05-21 23:23:48] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:23:48] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:23:48] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:23:48] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 11 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 93 places in 198 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 98 places in 242 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 20/376 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 29 places in 634 ms of which 2 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:23:53] [INFO ] Deduced a trap composed of 26 places in 500 ms of which 2 ms to minimize.
SMT process timed out in 9501ms, After SMT, problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (complete) has 710 edges and 367 vertex of which 364 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 364 transition count 288
Reduce places removed 28 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 42 rules applied. Total rules applied 72 place count 336 transition count 274
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 86 place count 322 transition count 274
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 86 place count 322 transition count 235
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 170 place count 277 transition count 235
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 197 place count 250 transition count 208
Iterating global reduction 3 with 27 rules applied. Total rules applied 224 place count 250 transition count 208
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 310 place count 207 transition count 165
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 207 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 312 place count 207 transition count 164
Applied a total of 312 rules in 217 ms. Remains 207 /367 variables (removed 160) and now considering 164/318 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 207/367 places, 164/318 transitions.
RANDOM walk for 40000 steps (8 resets) in 637 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 696516 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :1 out of 4
Probabilistic random walk after 696516 steps, saw 90200 distinct states, run finished after 3018 ms. (steps per millisecond=230 ) properties seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 164 rows 207 cols
[2024-05-21 23:23:56] [INFO ] Computed 50 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 104/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/192 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 14/206 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 164/370 variables, 206/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/371 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/371 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 257 constraints, problems are : Problem set: 0 solved, 3 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 207/207 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/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 104/189 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 11 places in 619 ms of which 18 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 8 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 9/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 8/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/75 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/192 variables, 3/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/206 variables, 11/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 164/370 variables, 206/295 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 2/297 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 3 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 15/312 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 9/321 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/371 variables, 1/322 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-05-ReachabilityFireability-2024-08 is UNSAT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 371/371 variables, and 323 constraints, problems are : Problem set: 3 solved, 0 unsolved in 6891 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 64/64 constraints]
After SMT, in 7580ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 22931 ms.

BK_STOP 1716333844515

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-05"
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-05, 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-171620399600487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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