Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531800206.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
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 r400-tall-171690531800206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 51M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716995332482

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 202405141337
[2024-05-29 15:08:53] [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]
[2024-05-29 15:08:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 15:08:55] [INFO ] Load time of PNML (sax parser for PT used): 2017 ms
[2024-05-29 15:08:55] [INFO ] Transformed 364 places.
[2024-05-29 15:08:56] [INFO ] Transformed 50444 transitions.
[2024-05-29 15:08:56] [INFO ] Found NUPN structural information;
[2024-05-29 15:08:56] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 2444 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 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-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 15:08:57] [INFO ] Flatten gal took : 757 ms
[2024-05-29 15:08:58] [INFO ] Flatten gal took : 428 ms
[2024-05-29 15:08:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3337934901201830027.gal : 181 ms
[2024-05-29 15:08:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality915154534092909911.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3337934901201830027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality915154534092909911.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
RANDOM walk for 40000 steps (9 resets) in 9650 ms. (4 steps per ms) remains 8/12 properties
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality915154534092909911.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
[2024-05-29 15:08:59] [INFO ] Flow matrix only has 2490 transitions (discarded 30 similar events)
// Phase 1: matrix 2490 rows 364 cols
[2024-05-29 15:08:59] [INFO ] Computed 11 invariants in 38 ms
[2024-05-29 15:08:59] [INFO ] State equation strengthened by 2185 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :9 after 60
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :60 after 68
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :68 after 81
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :81 after 217
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :217 after 529
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 272/363 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 272/373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/364 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :529 after 2273
At refinement iteration 8 (OVERLAPS) 2489/2853 variables, 364/739 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2853 variables, 2184/2923 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2853 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/2854 variables, 1/2924 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2854 variables, 0/2924 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/2854 variables, 0/2924 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2854/2854 variables, and 2924 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2901 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: 8/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 272/363 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 272/373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 15:09:04] [INFO ] Deduced a trap composed of 16 places in 890 ms of which 35 ms to minimize.
[2024-05-29 15:09:04] [INFO ] Deduced a trap composed of 16 places in 765 ms of which 3 ms to minimize.
[2024-05-29 15:09:05] [INFO ] Deduced a trap composed of 17 places in 672 ms of which 3 ms to minimize.
[2024-05-29 15:09:06] [INFO ] Deduced a trap composed of 16 places in 567 ms of which 14 ms to minimize.
[2024-05-29 15:09:06] [INFO ] Deduced a trap composed of 18 places in 570 ms of which 2 ms to minimize.
[2024-05-29 15:09:07] [INFO ] Deduced a trap composed of 17 places in 556 ms of which 2 ms to minimize.
[2024-05-29 15:09:07] [INFO ] Deduced a trap composed of 16 places in 455 ms of which 2 ms to minimize.
[2024-05-29 15:09:08] [INFO ] Deduced a trap composed of 17 places in 664 ms of which 5 ms to minimize.
SMT process timed out in 8847ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 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 358 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.26 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 358 transition count 2458
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 96 place count 332 transition count 2445
Reduce places removed 3 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 105 place count 329 transition count 2439
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 116 place count 323 transition count 2434
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 116 place count 323 transition count 2393
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 198 place count 282 transition count 2393
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 239 place count 241 transition count 2352
Iterating global reduction 4 with 41 rules applied. Total rules applied 280 place count 241 transition count 2352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 284 place count 241 transition count 2348
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 309 place count 216 transition count 2321
Iterating global reduction 5 with 25 rules applied. Total rules applied 334 place count 216 transition count 2321
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 338 place count 216 transition count 2317
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 352 place count 209 transition count 2310
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 354 place count 207 transition count 2308
Iterating global reduction 6 with 2 rules applied. Total rules applied 356 place count 207 transition count 2308
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 374 place count 207 transition count 2290
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 380 place count 204 transition count 2287
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 382 place count 202 transition count 2285
Iterating global reduction 6 with 2 rules applied. Total rules applied 384 place count 202 transition count 2285
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 386 place count 202 transition count 2283
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 401 place count 202 transition count 2268
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 416 place count 187 transition count 2268
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 428 place count 187 transition count 2268
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 436 place count 187 transition count 2260
Applied a total of 436 rules in 3831 ms. Remains 187 /364 variables (removed 177) and now considering 2260/2520 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3844 ms. Remains : 187/364 places, 2260/2520 transitions.
RANDOM walk for 40000 steps (8 resets) in 6666 ms. (5 steps per ms) remains 7/8 properties
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
// Phase 1: matrix 2260 rows 187 cols
[2024-05-29 15:09:14] [INFO ] Computed 10 invariants in 18 ms
[2024-05-29 15:09:14] [INFO ] State equation strengthened by 2154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 85/175 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/176 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2255/2431 variables, 176/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2431 variables, 1123/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2431 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 15/2446 variables, 10/1319 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2446 variables, 1031/2350 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2446 variables, 0/2350 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/2447 variables, 1/2351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2447 variables, 0/2351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/2447 variables, 0/2351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2447/2447 variables, and 2351 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 187/187 constraints, ReadFeed: 2154/2154 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 85/175 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Reachability property StigmergyCommit-PT-09a-ReachabilityCardinality-2024-13 is true.
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-05-29 15:09:16] [INFO ] Deduced a trap composed of 8 places in 554 ms of which 1 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 7 places in 544 ms of which 1 ms to minimize.
[2024-05-29 15:09:17] [INFO ] Deduced a trap composed of 12 places in 538 ms of which 1 ms to minimize.
[2024-05-29 15:09:18] [INFO ] Deduced a trap composed of 9 places in 534 ms of which 2 ms to minimize.
[2024-05-29 15:09:18] [INFO ] Deduced a trap composed of 7 places in 451 ms of which 1 ms to minimize.
[2024-05-29 15:09:19] [INFO ] Deduced a trap composed of 10 places in 374 ms of which 1 ms to minimize.
[2024-05-29 15:09:19] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 1 ms to minimize.
[2024-05-29 15:09:19] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-05-29 15:09:20] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 1 ms to minimize.
[2024-05-29 15:09:20] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-02 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 15:09:20] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-04 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 15:09:21] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-05 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 15:09:21] [INFO ] Deduced a trap composed of 12 places in 367 ms of which 1 ms to minimize.
[2024-05-29 15:09:21] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 1 ms to minimize.
[2024-05-29 15:09:22] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 1 ms to minimize.
[2024-05-29 15:09:22] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2024-05-29 15:09:22] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 0 ms to minimize.
[2024-05-29 15:09:22] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-05-29 15:09:23] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
[2024-05-29 15:09:23] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-02 is UNSAT
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-04 is UNSAT
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-05 is UNSAT
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-12 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/29 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-29 15:09:23] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 1 ms to minimize.
[2024-05-29 15:09:23] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2024-05-29 15:09:24] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 1 ms to minimize.
[2024-05-29 15:09:24] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2024-05-29 15:09:24] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:09:24] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:09:25] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 4 ms to minimize.
[2024-05-29 15:09:25] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2024-05-29 15:09:25] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2024-05-29 15:09:25] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-05-29 15:09:25] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:09:25] [INFO ] Deduced a trap composed of 14 places in 260 ms of which 1 ms to minimize.
[2024-05-29 15:09:26] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 0 ms to minimize.
[2024-05-29 15:09:26] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 1 ms to minimize.
[2024-05-29 15:09:26] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 1 ms to minimize.
[2024-05-29 15:09:27] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 1 ms to minimize.
[2024-05-29 15:09:27] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 1 ms to minimize.
[2024-05-29 15:09:27] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 0 ms to minimize.
[2024-05-29 15:09:28] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-05-29 15:09:28] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/49 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-29 15:09:28] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2024-05-29 15:09:28] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2024-05-29 15:09:28] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2024-05-29 15:09:29] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:09:29] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2024-05-29 15:09:29] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 15:09:29] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 1 ms to minimize.
[2024-05-29 15:09:30] [INFO ] Deduced a trap composed of 15 places in 338 ms of which 8 ms to minimize.
[2024-05-29 15:09:30] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 1 ms to minimize.
[2024-05-29 15:09:30] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 1 ms to minimize.
[2024-05-29 15:09:30] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-05-29 15:09:31] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 1 ms to minimize.
[2024-05-29 15:09:31] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 0 ms to minimize.
[2024-05-29 15:09:31] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2024-05-29 15:09:31] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:09:31] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 1 ms to minimize.
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 20/69 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2024-05-29 15:09:32] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2024-05-29 15:09:33] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 1 ms to minimize.
[2024-05-29 15:09:33] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2024-05-29 15:09:33] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 5/74 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/74 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/75 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/75 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2255/2431 variables, 176/251 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2431 variables, 1123/1374 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2431 variables, 1/1375 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-29 15:09:34] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2431 variables, 1/1376 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2431 variables, 0/1376 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 15/2446 variables, 10/1386 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2446 variables, 1031/2417 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2446 variables, 1/2418 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-29 15:09:35] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2024-05-29 15:09:35] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 15:09:35] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2024-05-29 15:09:36] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2024-05-29 15:09:36] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2446 variables, 5/2423 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-29 15:09:37] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2446 variables, 1/2424 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-29 15:09:37] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2446 variables, 1/2425 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2446 variables, 0/2425 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Problem StigmergyCommit-PT-09a-ReachabilityCardinality-2024-06 is UNSAT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 21 (OVERLAPS) 1/2447 variables, 1/2426 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2447 variables, 0/2426 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2447 variables, 0/2426 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2447/2447 variables, and 2426 constraints, problems are : Problem set: 6 solved, 1 unsolved in 22148 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 187/187 constraints, ReadFeed: 2154/2154 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 73/73 constraints]
After SMT, in 24102ms problems are : Problem set: 6 solved, 1 unsolved
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=13 )
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 11 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 44768 ms.

BK_STOP 1716995378437

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-5568"
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 r400-tall-171690531800206"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;