Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490700118.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 StigmergyCommit-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490700118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 51M May 29 14:33 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 StigmergyCommit-PT-09a-ReachabilityCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-11
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-12
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-13
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-14
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749106345452

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 06:52:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 06:52:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:52:31] [INFO ] Load time of PNML (sax parser for PT used): 2863 ms
[2025-06-05 06:52:31] [INFO ] Transformed 364 places.
[2025-06-05 06:52:31] [INFO ] Transformed 50444 transitions.
[2025-06-05 06:52:31] [INFO ] Found NUPN structural information;
[2025-06-05 06:52:31] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 3453 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 06:52:33] [INFO ] Flatten gal took : 1233 ms
[2025-06-05 06:52:34] [INFO ] Flatten gal took : 460 ms
[2025-06-05 06:52:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18017374167004389638.gal : 279 ms
[2025-06-05 06:52:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18271434377018121624.prop : 5 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/ReachabilityCardinality18017374167004389638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18271434377018121624.prop' '--nowitness' '--gen-order' 'FOLLOW'

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
RANDOM walk for 40000 steps (8 resets) in 12185 ms. (3 steps per ms) remains 10/14 properties
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
[2025-06-05 06:52:36] [INFO ] Flow matrix only has 2490 transitions (discarded 30 similar events)
// Phase 1: matrix 2490 rows 364 cols
[2025-06-05 06:52:36] [INFO ] Computed 11 invariants in 78 ms
Loading property file /tmp/ReachabilityCardinality18271434377018121624.prop.
[2025-06-05 06:52:36] [INFO ] State equation strengthened by 2185 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 291/364 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 291/375 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :9 after 60
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :60 after 68
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :68 after 81
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :81 after 217
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :217 after 529
At refinement iteration 6 (OVERLAPS) 2489/2853 variables, 364/739 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :529 after 2273
At refinement iteration 7 (INCLUDED_ONLY) 0/2853 variables, 2184/2923 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2853 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/2854 variables, 1/2924 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2854 variables, 0/2924 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/2854 variables, 0/2924 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2854/2854 variables, and 2924 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5045 ms.
Refiners :[Domain max(s): 364/364 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 364/364 constraints, ReadFeed: 2185/2185 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2025-09 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 291/364 variables, 10/84 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 291/375 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 16 places in 1751 ms of which 182 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 16 places in 1726 ms of which 386 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 16 places in 1541 ms of which 159 ms to minimize.
SMT process timed out in 11621ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 70 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Graph (complete) has 873 edges and 364 vertex of which 355 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.37 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 355 transition count 2460
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 41 rules applied. Total rules applied 93 place count 332 transition count 2442
Reduce places removed 4 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 19 rules applied. Total rules applied 112 place count 328 transition count 2427
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 135 place count 313 transition count 2419
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 135 place count 313 transition count 2368
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 237 place count 262 transition count 2368
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 277 place count 222 transition count 2328
Iterating global reduction 4 with 40 rules applied. Total rules applied 317 place count 222 transition count 2328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 321 place count 222 transition count 2324
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 342 place count 201 transition count 2303
Iterating global reduction 5 with 21 rules applied. Total rules applied 363 place count 201 transition count 2303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 368 place count 201 transition count 2298
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 370 place count 199 transition count 2296
Iterating global reduction 6 with 2 rules applied. Total rules applied 372 place count 199 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 373 place count 198 transition count 2295
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 198 transition count 2295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 375 place count 198 transition count 2294
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 391 place count 190 transition count 2286
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 397 place count 184 transition count 2280
Iterating global reduction 7 with 6 rules applied. Total rules applied 403 place count 184 transition count 2280
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 404 place count 183 transition count 2279
Iterating global reduction 7 with 1 rules applied. Total rules applied 405 place count 183 transition count 2279
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 406 place count 182 transition count 2278
Iterating global reduction 7 with 1 rules applied. Total rules applied 407 place count 182 transition count 2278
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 424 place count 182 transition count 2261
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 430 place count 179 transition count 2258
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 433 place count 176 transition count 2255
Iterating global reduction 7 with 3 rules applied. Total rules applied 436 place count 176 transition count 2255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 437 place count 176 transition count 2254
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 439 place count 176 transition count 2252
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 448 place count 176 transition count 2243
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 457 place count 167 transition count 2243
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 466 place count 167 transition count 2243
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 471 place count 167 transition count 2238
Applied a total of 471 rules in 6830 ms. Remains 167 /364 variables (removed 197) and now considering 2238/2520 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6843 ms. Remains : 167/364 places, 2238/2520 transitions.
RANDOM walk for 40000 steps (9 resets) in 11026 ms. (3 steps per ms) remains 6/9 properties
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
// Phase 1: matrix 2238 rows 167 cols
[2025-06-05 06:52:57] [INFO ] Computed 8 invariants in 29 ms
[2025-06-05 06:52:59] [INFO ] State equation strengthened by 2144 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 101/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2192/2321 variables, 129/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2321 variables, 331/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2321 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 57/2378 variables, 22/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2378 variables, 1807/2297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2378 variables, 0/2297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 19/2397 variables, 11/2308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2397 variables, 3/2311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2397 variables, 0/2311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/2404 variables, 4/2315 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2404 variables, 3/2318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2404 variables, 0/2318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/2405 variables, 1/2319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2405 variables, 0/2319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/2405 variables, 0/2319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2405/2405 variables, and 2319 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3712 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 2144/2144 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 101/129 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 6 places in 702 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 6 places in 602 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 6 places in 703 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 7 places in 637 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:06] [INFO ] Deduced a trap composed of 9 places in 579 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:06] [INFO ] Deduced a trap composed of 9 places in 529 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 9 places in 517 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 9 places in 434 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 9 places in 416 ms of which 10 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2025-02 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 10 places in 494 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 11 places in 379 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 11 places in 425 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 4 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2025-02 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 20/28 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:12] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:12] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:12] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 6/34 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 10 places in 465 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 10 places in 599 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 3/38 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2192/2321 variables, 129/167 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2321 variables, 331/498 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2321 variables, 2/500 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2321 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 57/2378 variables, 22/522 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2378 variables, 1807/2329 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2378 variables, 1/2330 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:17] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:17] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2378 variables, 7/2337 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2378 variables, 0/2337 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 19/2397 variables, 11/2348 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2397 variables, 3/2351 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:22] [INFO ] Deduced a trap composed of 8 places in 284 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:22] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:23] [INFO ] Deduced a trap composed of 9 places in 365 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:23] [INFO ] Deduced a trap composed of 12 places in 355 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:24] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:24] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:25] [INFO ] Deduced a trap composed of 7 places in 613 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:25] [INFO ] Deduced a trap composed of 8 places in 460 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:26] [INFO ] Deduced a trap composed of 9 places in 554 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:27] [INFO ] Deduced a trap composed of 10 places in 509 ms of which 10 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2397 variables, 10/2361 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2397 variables, 0/2361 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 7/2404 variables, 4/2365 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2404 variables, 3/2368 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2404 variables, 0/2368 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2025-05 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 23 (OVERLAPS) 1/2405 variables, 1/2369 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:32] [INFO ] Deduced a trap composed of 7 places in 587 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 06:53:32] [INFO ] Deduced a trap composed of 7 places in 428 ms of which 10 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2025-13 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 24 (INCLUDED_ONLY) 0/2405 variables, 2/2371 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2405 variables, 0/2371 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/2405 variables, 0/2371 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2405/2405 variables, and 2371 constraints, problems are : Problem set: 3 solved, 3 unsolved in 31483 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 2144/2144 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36760ms problems are : Problem set: 3 solved, 3 unsolved
Finished Parikh walk after 2568 steps, including 36 resets, run visited all 3 properties in 165 ms. (steps per millisecond=15 )
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2025-01 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 189 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 66683 ms.

BK_STOP 1749106414705

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="StigmergyCommit-PT-09a"
export BK_EXAMINATION="ReachabilityCardinality"
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 StigmergyCommit-PT-09a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490700118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09a.tgz
mv StigmergyCommit-PT-09a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;