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-171690531700134.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-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531700134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 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 627K 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-04b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717229977160

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-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:19:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:19:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:19:38] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-06-01 08:19:38] [INFO ] Transformed 1534 places.
[2024-06-01 08:19:38] [INFO ] Transformed 2136 transitions.
[2024-06-01 08:19:38] [INFO ] Found NUPN structural information;
[2024-06-01 08:19:38] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (416 resets) in 1885 ms. (21 steps per ms) remains 13/14 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (75 resets) in 235 ms. (169 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (78 resets) in 498 ms. (80 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 455 ms. (87 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (79 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (72 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (77 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (80 resets) in 214 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (76 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (74 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 351857 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :2 out of 13
Probabilistic random walk after 351857 steps, saw 68435 distinct states, run finished after 3012 ms. (steps per millisecond=116 ) properties seen :2
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2136 rows 1534 cols
[2024-06-01 08:19:43] [INFO ] Computed 6 invariants in 46 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1467/1515 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1515 variables, 1467/1520 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1515 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 19/1534 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1534 variables, 19/1540 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1534 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2136/3670 variables, 1534/3074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3670 variables, 0/3074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/3670 variables, 0/3074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3670/3670 variables, and 3074 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2641 ms.
Refiners :[Domain max(s): 1534/1534 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1534/1534 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1467/1515 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1515 variables, 1467/1520 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:19:47] [INFO ] Deduced a trap composed of 398 places in 774 ms of which 75 ms to minimize.
[2024-06-01 08:19:47] [INFO ] Deduced a trap composed of 397 places in 435 ms of which 7 ms to minimize.
[2024-06-01 08:19:47] [INFO ] Deduced a trap composed of 398 places in 410 ms of which 7 ms to minimize.
[2024-06-01 08:19:48] [INFO ] Deduced a trap composed of 399 places in 421 ms of which 6 ms to minimize.
[2024-06-01 08:19:48] [INFO ] Deduced a trap composed of 399 places in 499 ms of which 7 ms to minimize.
[2024-06-01 08:19:49] [INFO ] Deduced a trap composed of 396 places in 442 ms of which 6 ms to minimize.
[2024-06-01 08:19:49] [INFO ] Deduced a trap composed of 399 places in 445 ms of which 7 ms to minimize.
[2024-06-01 08:19:50] [INFO ] Deduced a trap composed of 399 places in 564 ms of which 8 ms to minimize.
[2024-06-01 08:19:51] [INFO ] Deduced a trap composed of 398 places in 541 ms of which 7 ms to minimize.
SMT process timed out in 8027ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1423 edges and 1534 vertex of which 82 / 1534 are part of one of the 12 SCC in 7 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Graph (complete) has 2187 edges and 1464 vertex of which 1457 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1062 transitions
Trivial Post-agglo rules discarded 1062 transitions
Performed 1062 trivial Post agglomeration. Transition count delta: 1062
Iterating post reduction 0 with 1065 rules applied. Total rules applied 1067 place count 1457 transition count 979
Reduce places removed 1062 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 1088 rules applied. Total rules applied 2155 place count 395 transition count 953
Reduce places removed 12 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 46 rules applied. Total rules applied 2201 place count 383 transition count 919
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 2235 place count 349 transition count 919
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 2235 place count 349 transition count 866
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 2341 place count 296 transition count 866
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 2398 place count 239 transition count 809
Iterating global reduction 4 with 57 rules applied. Total rules applied 2455 place count 239 transition count 809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 2457 place count 239 transition count 807
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2458 place count 238 transition count 807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2458 place count 238 transition count 806
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2460 place count 237 transition count 806
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 2486 place count 211 transition count 432
Iterating global reduction 6 with 26 rules applied. Total rules applied 2512 place count 211 transition count 432
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2524 place count 211 transition count 420
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2529 place count 206 transition count 415
Iterating global reduction 7 with 5 rules applied. Total rules applied 2534 place count 206 transition count 415
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2539 place count 201 transition count 410
Iterating global reduction 7 with 5 rules applied. Total rules applied 2544 place count 201 transition count 410
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2547 place count 201 transition count 407
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 2589 place count 180 transition count 386
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2590 place count 180 transition count 385
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2595 place count 175 transition count 380
Iterating global reduction 9 with 5 rules applied. Total rules applied 2600 place count 175 transition count 380
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2604 place count 171 transition count 376
Iterating global reduction 9 with 4 rules applied. Total rules applied 2608 place count 171 transition count 376
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2612 place count 167 transition count 372
Iterating global reduction 9 with 4 rules applied. Total rules applied 2616 place count 167 transition count 372
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 2622 place count 164 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2623 place count 164 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2625 place count 164 transition count 379
Free-agglomeration rule applied 37 times.
Iterating global reduction 10 with 37 rules applied. Total rules applied 2662 place count 164 transition count 342
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 10 with 37 rules applied. Total rules applied 2699 place count 127 transition count 342
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 2704 place count 122 transition count 337
Iterating global reduction 11 with 5 rules applied. Total rules applied 2709 place count 122 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 11 with 26 rules applied. Total rules applied 2735 place count 122 transition count 311
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 2743 place count 122 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 2747 place count 122 transition count 307
Applied a total of 2747 rules in 292 ms. Remains 122 /1534 variables (removed 1412) and now considering 307/2136 (removed 1829) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 122/1534 places, 307/2136 transitions.
RANDOM walk for 40000 steps (829 resets) in 709 ms. (56 steps per ms) remains 4/11 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (223 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (244 resets) in 198 ms. (201 steps per ms) remains 3/4 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (223 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (226 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
// Phase 1: matrix 307 rows 122 cols
[2024-06-01 08:19:51] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 08:19:51] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 269/357 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 139/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 34/391 variables, 11/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 25/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 22/413 variables, 14/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/418 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/422 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 4/426 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/426 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/426 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 3/429 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/429 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/429 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 295 constraints, problems are : Problem set: 0 solved, 3 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:19:52] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:19:52] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:19:52] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-04b-ReachabilityCardinality-2024-14 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 269/357 variables, 88/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 139/235 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 08:19:52] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/391 variables, 11/247 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 25/272 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 2/274 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 22/413 variables, 14/288 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 1/289 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/418 variables, 3/292 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 1/293 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/422 variables, 2/295 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/422 variables, 1/296 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/422 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/426 variables, 2/298 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/426 variables, 1/299 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/426 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 3/429 variables, 2/301 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 08:19:52] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2024-06-01 08:19:52] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/429 variables, 2/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/429 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/429 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 303 constraints, problems are : Problem set: 1 solved, 2 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 1058ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 230 steps, including 6 resets, run visited all 2 properties in 3 ms. (steps per millisecond=76 )
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityCardinality-2024-00 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 )
Parikh walk visited 2 properties in 7 ms.
All properties solved without resorting to model-checking.
Total runtime 14667 ms.
ITS solved all properties within timeout

BK_STOP 1717229992980

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-04b"
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-04b, 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-171690531700134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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