Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300119.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BusinessProcesses-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 157K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748597180767

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 09:26:23] [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]
[2025-05-30 09:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 09:26:23] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2025-05-30 09:26:23] [INFO ] Transformed 630 places.
[2025-05-30 09:26:23] [INFO ] Transformed 566 transitions.
[2025-05-30 09:26:23] [INFO ] Found NUPN structural information;
[2025-05-30 09:26:23] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 28 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (272 resets) in 3220 ms. (12 steps per ms) remains 11/15 properties
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 09:26:25] [INFO ] Flatten gal took : 240 ms
BEST_FIRST walk for 40002 steps (48 resets) in 571 ms. (69 steps per ms) remains 11/11 properties
[2025-05-30 09:26:25] [INFO ] Flatten gal took : 157 ms
BEST_FIRST walk for 40003 steps (46 resets) in 247 ms. (161 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
[2025-05-30 09:26:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12774907194281962440.gal : 130 ms
BEST_FIRST walk for 40004 steps (50 resets) in 579 ms. (68 steps per ms) remains 11/11 properties
[2025-05-30 09:26:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17991892154365538604.prop : 9 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12774907194281962440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17991892154365538604.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (48 resets) in 256 ms. (155 steps per ms) remains 11/11 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17991892154365538604.prop.
BEST_FIRST walk for 40002 steps (57 resets) in 994 ms. (40 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (46 resets) in 271 ms. (147 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
BEST_FIRST walk for 40002 steps (52 resets) in 364 ms. (109 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 30
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :30 after 65
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :65 after 113
BEST_FIRST walk for 40004 steps (58 resets) in 305 ms. (130 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :113 after 8179
BEST_FIRST walk for 40004 steps (49 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (47 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
// Phase 1: matrix 562 rows 626 cols
[2025-05-30 09:26:26] [INFO ] Computed 102 invariants in 57 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2025-14 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 360/528 variables, 61/229 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 360/589 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 1/590 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/590 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2025-13 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 98/626 variables, 40/630 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 98/728 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 0/728 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 562/1188 variables, 626/1354 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 1354 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5114 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 11/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 397/513 variables, 59/175 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 397/572 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:32] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:33] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:33] [INFO ] Deduced a trap composed of 14 places in 444 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:33] [INFO ] Deduced a trap composed of 15 places in 430 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:34] [INFO ] Deduced a trap composed of 17 places in 477 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:35] [INFO ] Deduced a trap composed of 18 places in 460 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:35] [INFO ] Deduced a trap composed of 18 places in 346 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:35] [INFO ] Deduced a trap composed of 20 places in 339 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:36] [INFO ] Deduced a trap composed of 22 places in 476 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:36] [INFO ] Deduced a trap composed of 96 places in 446 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:37] [INFO ] Deduced a trap composed of 96 places in 514 ms of which 90 ms to minimize.
SMT process timed out in 10818ms, After SMT, problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 116 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 623 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 623 transition count 505
Reduce places removed 57 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 65 rules applied. Total rules applied 123 place count 566 transition count 497
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 131 place count 558 transition count 497
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 131 place count 558 transition count 379
Deduced a syphon composed of 118 places in 3 ms
Ensure Unique test removed 12 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 379 place count 428 transition count 379
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 447 place count 360 transition count 311
Iterating global reduction 3 with 68 rules applied. Total rules applied 515 place count 360 transition count 311
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 615 place count 309 transition count 262
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 618 place count 309 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 308 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 620 place count 307 transition count 261
Applied a total of 620 rules in 354 ms. Remains 307 /626 variables (removed 319) and now considering 261/562 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 307/626 places, 261/562 transitions.
RANDOM walk for 40000 steps (620 resets) in 1086 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (139 resets) in 315 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (146 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (141 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (152 resets) in 419 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (142 resets) in 290 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (155 resets) in 368 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (137 resets) in 254 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (140 resets) in 301 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (139 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 444892 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :4 out of 9
Probabilistic random walk after 444892 steps, saw 71983 distinct states, run finished after 3012 ms. (steps per millisecond=147 ) properties seen :4
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 261 rows 307 cols
[2025-05-30 09:26:41] [INFO ] Computed 84 invariants in 11 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 160/260 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 43/303 variables, 27/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 260/563 variables, 303/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/568 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/568 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 391 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1280 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 160/260 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:43] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:43] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:43] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:44] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:44] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:44] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:44] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:44] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:44] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:45] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:45] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:45] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:45] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:45] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:45] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:46] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:46] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:46] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:46] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:46] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:46] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:46] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:47] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:47] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 22 ms to minimize.
Problem BusinessProcesses-PT-15-ReachabilityFireability-2025-11 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 4/81 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:47] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:47] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:47] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:47] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:47] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:48] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:48] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 7/88 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2025-05 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 43/303 variables, 27/115 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:48] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 30 ms to minimize.
Problem BusinessProcesses-PT-15-ReachabilityFireability-2025-03 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:48] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:48] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 25 ms to minimize.
Problem BusinessProcesses-PT-15-ReachabilityFireability-2025-10 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 3/118 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 260/563 variables, 303/421 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 1/422 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:49] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:49] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:49] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:49] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:49] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 5/427 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:49] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 3 ms to minimize.
Problem BusinessProcesses-PT-15-ReachabilityFireability-2025-09 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 563/568 variables, and 428 constraints, problems are : Problem set: 5 solved, 0 unsolved in 6591 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 303/307 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7913ms problems are : Problem set: 5 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 26531 ms.

BK_STOP 1748597210002

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-15"
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-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-15, 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 r030-smll-174853813300119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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