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-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 itstools
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 r048-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 1716333669649

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 23:21:11] [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:21:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:21:11] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-21 23:21:11] [INFO ] Transformed 262 places.
[2024-05-21 23:21:11] [INFO ] Transformed 219 transitions.
[2024-05-21 23:21:11] [INFO ] Found NUPN structural information;
[2024-05-21 23:21:11] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 212 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 2 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 (543 resets) in 2296 ms. (17 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
[2024-05-21 23:21:12] [INFO ] Flatten gal took : 55 ms
[2024-05-21 23:21:12] [INFO ] Flatten gal took : 119 ms
BEST_FIRST walk for 40004 steps (96 resets) in 678 ms. (58 steps per ms) remains 8/8 properties
[2024-05-21 23:21:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11517229602504984183.gal : 19 ms
BEST_FIRST walk for 40003 steps (102 resets) in 301 ms. (132 steps per ms) remains 8/8 properties
[2024-05-21 23:21:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1404534857734275576.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11517229602504984183.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1404534857734275576.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (100 resets) in 527 ms. (75 steps per ms) remains 8/8 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
BEST_FIRST walk for 40004 steps (101 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality1404534857734275576.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :14 after 17
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :17 after 31
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :31 after 1.07883e+08
BEST_FIRST walk for 40003 steps (111 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (91 resets) in 336 ms. (118 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (102 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (99 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
// Phase 1: matrix 204 rows 245 cols
[2024-05-21 23:21:13] [INFO ] Computed 43 invariants in 52 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 1107 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-05-21 23:21:15] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 25 ms to minimize.
[2024-05-21 23:21:15] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 5 ms to minimize.
[2024-05-21 23:21:15] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:21:15] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 2 ms to minimize.
[2024-05-21 23:21:15] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:21:15] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 1 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 3 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 19 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 12 places in 387 ms of which 1 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 64 places in 71 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-05-21 23:21:17] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:21:17] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:21:18] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:21:18] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:21:18] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:21:18] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:21:18] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:21:18] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:21:18] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:21:19] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:21:19] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:21:19] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 8 ms to minimize.
[2024-05-21 23:21:19] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:21:19] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 5 ms to minimize.
SMT process timed out in 6364ms, 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 148 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 168 ms. Remains : 140/245 places, 107/204 transitions.
RANDOM walk for 40000 steps (1139 resets) in 737 ms. (54 steps per ms) remains 4/5 properties
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (219 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (200 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (218 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (217 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
// Phase 1: matrix 107 rows 140 cols
[2024-05-21 23:21:20] [INFO ] Computed 35 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 53/91 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/102 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/116 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 97/213 variables, 116/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 27/240 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/242 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 5/247 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 0 solved, 4 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 140/140 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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 53/91 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 11/102 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 14/116 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 97/213 variables, 116/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 27/240 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2024-05-21 23:21:21] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/240 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/242 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/242 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 5/247 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/247 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/247 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 189 constraints, problems are : Problem set: 0 solved, 4 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 1542ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 354 ms.
Support contains 19 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 107/107 transitions.
Graph (trivial) has 40 edges and 140 vertex of which 4 / 140 are part of one of the 1 SCC in 3 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.1 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 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 26 place count 123 transition count 82
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 40 place count 115 transition count 82
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 109 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 109 transition count 76
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 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 92 place count 88 transition count 57
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 93 place count 88 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 87 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 87 transition count 56
Applied a total of 95 rules in 37 ms. Remains 87 /140 variables (removed 53) and now considering 56/107 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 87/140 places, 56/107 transitions.
RANDOM walk for 40000 steps (2331 resets) in 244 ms. (163 steps per ms) remains 1/2 properties
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (600 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
// Phase 1: matrix 56 rows 87 cols
[2024-05-21 23:21:22] [INFO ] Computed 32 invariants in 8 ms
[2024-05-21 23:21:22] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 37/55 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/72 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/80 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/135 variables, 80/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/142 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/143 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/143 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 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) 37/55 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/72 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:21:22] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:21:22] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/80 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 55/135 variables, 80/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/142 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/142 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/142 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/143 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:21:22] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:21:22] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:21:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-02-ReachabilityFireability-2024-09 is UNSAT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 143/143 variables, and 126 constraints, problems are : Problem set: 1 solved, 0 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 389ms problems are : Problem set: 1 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 11454 ms.

BK_STOP 1716333682687

--------------------
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-02"
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-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 r048-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 ;