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.r536-tall-171690531800214.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 ltsminxred
Input is StigmergyCommit-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531800214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 126M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 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 126M 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-09b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2023-09
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717238841787

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:47:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:47:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:47:27] [INFO ] Load time of PNML (sax parser for PT used): 4154 ms
[2024-06-01 10:47:27] [INFO ] Transformed 3049 places.
[2024-06-01 10:47:27] [INFO ] Transformed 122340 transitions.
[2024-06-01 10:47:27] [INFO ] Found NUPN structural information;
[2024-06-01 10:47:27] [INFO ] Parsed PT model containing 3049 places and 122340 transitions and 2389246 arcs in 4827 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (217 resets) in 5416 ms. (7 steps per ms) remains 15/16 properties
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 159 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 6561 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :0 out of 15
Probabilistic random walk after 6561 steps, saw 4946 distinct states, run finished after 3006 ms. (steps per millisecond=2 ) properties seen :0
// Phase 1: matrix 122340 rows 3049 cols
[2024-06-01 10:47:38] [INFO ] Computed 11 invariants in 4388 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2935/3049 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3049 variables, 2935/3060 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3049 variables, 0/3060 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 10564ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 114 out of 3049 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3049/3049 places, 122340/122340 transitions.
Graph (trivial) has 2799 edges and 3049 vertex of which 184 / 3049 are part of one of the 28 SCC in 31 ms
Free SCC test removed 156 places
Drop transitions (Empty/Sink Transition effects.) removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Graph (complete) has 5432 edges and 2893 vertex of which 2873 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.325 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2044 transitions
Trivial Post-agglo rules discarded 2044 transitions
Performed 2044 trivial Post agglomeration. Transition count delta: 2044
Iterating post reduction 0 with 2054 rules applied. Total rules applied 2056 place count 2873 transition count 120077
Reduce places removed 2044 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 2094 rules applied. Total rules applied 4150 place count 829 transition count 120027
Reduce places removed 22 places and 0 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Iterating post reduction 2 with 117 rules applied. Total rules applied 4267 place count 807 transition count 119932
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 3 with 95 rules applied. Total rules applied 4362 place count 712 transition count 119932
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 4362 place count 712 transition count 119825
Deduced a syphon composed of 107 places in 96 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 4576 place count 605 transition count 119825
Discarding 107 places :
Symmetric choice reduction at 4 with 107 rule applications. Total rules 4683 place count 498 transition count 119718
Iterating global reduction 4 with 107 rules applied. Total rules applied 4790 place count 498 transition count 119718
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 4793 place count 498 transition count 119715
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 4844 place count 447 transition count 4126
Iterating global reduction 5 with 51 rules applied. Total rules applied 4895 place count 447 transition count 4126
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 4910 place count 447 transition count 4111
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4914 place count 443 transition count 4107
Iterating global reduction 6 with 4 rules applied. Total rules applied 4918 place count 443 transition count 4107
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 4920 place count 441 transition count 4105
Iterating global reduction 6 with 2 rules applied. Total rules applied 4922 place count 441 transition count 4105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4924 place count 441 transition count 4103
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 4994 place count 406 transition count 4068
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 5003 place count 397 transition count 4059
Iterating global reduction 7 with 9 rules applied. Total rules applied 5012 place count 397 transition count 4059
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 5018 place count 391 transition count 4053
Iterating global reduction 7 with 6 rules applied. Total rules applied 5024 place count 391 transition count 4053
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 5028 place count 387 transition count 4049
Iterating global reduction 7 with 4 rules applied. Total rules applied 5032 place count 387 transition count 4049
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 5038 place count 384 transition count 4068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 5039 place count 384 transition count 4067
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 5044 place count 384 transition count 4062
Free-agglomeration rule applied 85 times.
Iterating global reduction 8 with 85 rules applied. Total rules applied 5129 place count 384 transition count 3977
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 8 with 85 rules applied. Total rules applied 5214 place count 299 transition count 3977
Drop transitions (Redundant composition of simpler transitions.) removed 1532 transitions
Redundant transition composition rules discarded 1532 transitions
Iterating global reduction 9 with 1532 rules applied. Total rules applied 6746 place count 299 transition count 2445
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 6750 place count 299 transition count 2441
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 6754 place count 295 transition count 2441
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 6765 place count 295 transition count 2441
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 6766 place count 295 transition count 2441
Applied a total of 6766 rules in 31801 ms. Remains 295 /3049 variables (removed 2754) and now considering 2441/122340 (removed 119899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31815 ms. Remains : 295/3049 places, 2441/122340 transitions.
RANDOM walk for 40000 steps (613 resets) in 1453 ms. (27 steps per ms) remains 9/15 properties
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (85 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (85 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (85 resets) in 91 ms. (434 steps per ms) remains 8/9 properties
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (87 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (85 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (45 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (85 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (85 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
// Phase 1: matrix 2441 rows 295 cols
[2024-06-01 10:48:17] [INFO ] Computed 11 invariants in 17 ms
[2024-06-01 10:48:17] [INFO ] State equation strengthened by 1984 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 230/293 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/295 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2441/2736 variables, 295/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2736 variables, 1984/2290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2736 variables, 0/2290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/2736 variables, 0/2290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2736/2736 variables, and 2290 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2905 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 295/295 constraints, ReadFeed: 1984/1984 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 230/293 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:48:21] [INFO ] Deduced a trap composed of 41 places in 850 ms of which 16 ms to minimize.
[2024-06-01 10:48:22] [INFO ] Deduced a trap composed of 33 places in 987 ms of which 2 ms to minimize.
[2024-06-01 10:48:23] [INFO ] Deduced a trap composed of 33 places in 716 ms of which 2 ms to minimize.
[2024-06-01 10:48:24] [INFO ] Deduced a trap composed of 48 places in 812 ms of which 2 ms to minimize.
[2024-06-01 10:48:24] [INFO ] Deduced a trap composed of 36 places in 701 ms of which 3 ms to minimize.
[2024-06-01 10:48:25] [INFO ] Deduced a trap composed of 27 places in 697 ms of which 2 ms to minimize.
[2024-06-01 10:48:26] [INFO ] Deduced a trap composed of 41 places in 690 ms of which 2 ms to minimize.
[2024-06-01 10:48:26] [INFO ] Deduced a trap composed of 45 places in 663 ms of which 2 ms to minimize.
[2024-06-01 10:48:27] [INFO ] Deduced a trap composed of 28 places in 661 ms of which 1 ms to minimize.
[2024-06-01 10:48:28] [INFO ] Deduced a trap composed of 41 places in 694 ms of which 1 ms to minimize.
[2024-06-01 10:48:28] [INFO ] Deduced a trap composed of 39 places in 695 ms of which 1 ms to minimize.
[2024-06-01 10:48:29] [INFO ] Deduced a trap composed of 48 places in 667 ms of which 2 ms to minimize.
[2024-06-01 10:48:30] [INFO ] Deduced a trap composed of 45 places in 696 ms of which 2 ms to minimize.
[2024-06-01 10:48:30] [INFO ] Deduced a trap composed of 33 places in 670 ms of which 1 ms to minimize.
[2024-06-01 10:48:31] [INFO ] Deduced a trap composed of 29 places in 666 ms of which 1 ms to minimize.
[2024-06-01 10:48:32] [INFO ] Deduced a trap composed of 34 places in 685 ms of which 1 ms to minimize.
[2024-06-01 10:48:32] [INFO ] Deduced a trap composed of 37 places in 687 ms of which 2 ms to minimize.
[2024-06-01 10:48:33] [INFO ] Deduced a trap composed of 34 places in 689 ms of which 1 ms to minimize.
[2024-06-01 10:48:34] [INFO ] Deduced a trap composed of 22 places in 714 ms of which 2 ms to minimize.
[2024-06-01 10:48:35] [INFO ] Deduced a trap composed of 32 places in 705 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:48:35] [INFO ] Deduced a trap composed of 39 places in 775 ms of which 1 ms to minimize.
[2024-06-01 10:48:36] [INFO ] Deduced a trap composed of 39 places in 737 ms of which 2 ms to minimize.
[2024-06-01 10:48:37] [INFO ] Deduced a trap composed of 36 places in 738 ms of which 2 ms to minimize.
[2024-06-01 10:48:38] [INFO ] Deduced a trap composed of 36 places in 745 ms of which 1 ms to minimize.
[2024-06-01 10:48:39] [INFO ] Deduced a trap composed of 44 places in 773 ms of which 1 ms to minimize.
[2024-06-01 10:48:39] [INFO ] Deduced a trap composed of 40 places in 770 ms of which 1 ms to minimize.
[2024-06-01 10:48:40] [INFO ] Deduced a trap composed of 38 places in 751 ms of which 1 ms to minimize.
[2024-06-01 10:48:41] [INFO ] Deduced a trap composed of 48 places in 707 ms of which 1 ms to minimize.
[2024-06-01 10:48:42] [INFO ] Deduced a trap composed of 39 places in 693 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-09b-ReachabilityCardinality-2023-09 is UNSAT
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2023-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 9/39 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/295 variables, 1/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2441/2736 variables, 295/335 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2736 variables, 1984/2319 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2736 variables, 7/2326 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2736 variables, 0/2326 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/2736 variables, 0/2326 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2736/2736 variables, and 2326 constraints, problems are : Problem set: 1 solved, 7 unsolved in 27631 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 295/295 constraints, ReadFeed: 1984/1984 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 29/29 constraints]
After SMT, in 31051ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 4944 steps, including 246 resets, run visited all 7 properties in 111 ms. (steps per millisecond=44 )
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-2024-01 FALSE 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 )
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 7 properties in 121 ms.
All properties solved without resorting to model-checking.
Total runtime 85250 ms.
ITS solved all properties within timeout

BK_STOP 1717238928286

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-09b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyCommit-PT-09b, 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 r536-tall-171690531800214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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