fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r084-tall-174860079800038
Last Updated
June 24, 2025

About the Execution of 2024-gold for DLCflexbar-PT-5b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15687.520 200606.00 458473.00 362.20 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r084-tall-174860079800038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is DLCflexbar-PT-5b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860079800038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 6.5M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748732966887

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DLCflexbar-PT-5b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 23:09:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 23:09:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:09:29] [INFO ] Load time of PNML (sax parser for PT used): 736 ms
[2025-05-31 23:09:29] [INFO ] Transformed 17305 places.
[2025-05-31 23:09:29] [INFO ] Transformed 26483 transitions.
[2025-05-31 23:09:29] [INFO ] Found NUPN structural information;
[2025-05-31 23:09:30] [INFO ] Parsed PT model containing 17305 places and 26483 transitions and 73264 arcs in 1595 ms.
Graph (trivial) has 15844 edges and 17305 vertex of which 1384 / 17305 are part of one of the 90 SCC in 45 ms
Free SCC test removed 1294 places
Structural test allowed to assert that 9066 places are NOT stable. Took 141 ms.
Ensure Unique test removed 1370 transitions
Reduce redundant transitions removed 1370 transitions.
RANDOM walk for 40000 steps (8 resets) in 22286 ms. (1 steps per ms) remains 5915/8239 properties
BEST_FIRST walk for 123 steps (8 resets) in 36 ms. (3 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 82 ms. (1 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 29 ms. (4 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 120 steps (8 resets) in 148 ms. (0 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 24 ms. (4 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 120 steps (8 resets) in 26 ms. (4 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 25 ms. (4 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 24 ms. (4 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 24 ms. (4 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 124 steps (8 resets) in 25 ms. (4 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 23 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 120 steps (8 resets) in 23 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 23 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 120 steps (8 resets) in 24 ms. (4 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 18 ms. (6 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 22 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 19 ms. (6 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 21 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 21 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 22 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 23 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 21 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 17 ms. (6 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 19 ms. (6 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 22 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 22 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 19 ms. (6 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 19 ms. (6 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 24 ms. (4 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 22 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 121 steps (8 resets) in 19 ms. (6 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 22 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 122 steps (8 resets) in 22 ms. (5 steps per ms) remains 5915/5915 properties
BEST_FIRST walk for 123 steps (8 resets) in 20 ms. (5 steps per ms) remains 5915/5915 properties
[2025-05-31 23:09:39] [INFO ] Flow matrix only has 25024 transitions (discarded 89 similar events)
// Phase 1: matrix 25024 rows 16011 cols
[2025-05-31 23:09:39] [INFO ] Computed 979 invariants in 167 ms
[2025-05-31 23:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5915 variables, 5915/5915 constraints. Problems are: Problem set: 0 solved, 5915 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5915/41035 variables, and 5915 constraints, problems are : Problem set: 0 solved, 5915 unsolved in 5333 ms.
Refiners :[Domain max(s): 5915/16011 constraints, Positive P Invariants (semi-flows): 0/979 constraints, State Equation: 0/16011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 5915/5915 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5915 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5915 variables, 5915/5915 constraints. Problems are: Problem set: 0 solved, 5915 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5915/41035 variables, and 5915 constraints, problems are : Problem set: 0 solved, 5915 unsolved in 5164 ms.
Refiners :[Domain max(s): 5915/16011 constraints, Positive P Invariants (semi-flows): 0/979 constraints, State Equation: 0/16011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/5915 constraints, Known Traps: 0/0 constraints]
After SMT, in 25445ms problems are : Problem set: 0 solved, 5915 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5915 out of 16011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16011/16011 places, 25113/25113 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4143 transitions
Trivial Post-agglo rules discarded 4143 transitions
Performed 4143 trivial Post agglomeration. Transition count delta: 4143
Iterating post reduction 0 with 4233 rules applied. Total rules applied 4233 place count 16011 transition count 20880
Reduce places removed 4143 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 4198 rules applied. Total rules applied 8431 place count 11868 transition count 20825
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 8455 place count 11844 transition count 20825
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 8455 place count 11844 transition count 20763
Deduced a syphon composed of 62 places in 520 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 8579 place count 11782 transition count 20763
Discarding 456 places :
Symmetric choice reduction at 3 with 456 rule applications. Total rules 9035 place count 11326 transition count 20307
Iterating global reduction 3 with 456 rules applied. Total rules applied 9491 place count 11326 transition count 20307
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 9491 place count 11326 transition count 20189
Deduced a syphon composed of 118 places in 554 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 9727 place count 11208 transition count 20189
Discarding 101 places :
Symmetric choice reduction at 3 with 101 rule applications. Total rules 9828 place count 11107 transition count 16554
Iterating global reduction 3 with 101 rules applied. Total rules applied 9929 place count 11107 transition count 16554
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 3 with 67 rules applied. Total rules applied 9996 place count 11107 transition count 16487
Performed 1901 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 1901 places in 5 ms
Reduce places removed 1901 places and 0 transitions.
Iterating global reduction 4 with 3802 rules applied. Total rules applied 13798 place count 9206 transition count 14579
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 13805 place count 9206 transition count 14572
Renaming transitions due to excessive name length > 1024 char.
Performed 49 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 49 places in 6 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 13903 place count 9157 transition count 14880
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 13905 place count 9155 transition count 14852
Iterating global reduction 5 with 2 rules applied. Total rules applied 13907 place count 9155 transition count 14852
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 13921 place count 9155 transition count 14838
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 6 with 96 rules applied. Total rules applied 14017 place count 9155 transition count 14742
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 14030 place count 9142 transition count 14729
Iterating global reduction 6 with 13 rules applied. Total rules applied 14043 place count 9142 transition count 14729
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 14056 place count 9129 transition count 13845
Iterating global reduction 6 with 13 rules applied. Total rules applied 14069 place count 9129 transition count 13845
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 14082 place count 9129 transition count 13832
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 14096 place count 9122 transition count 13825
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 14103 place count 9115 transition count 13349
Iterating global reduction 7 with 7 rules applied. Total rules applied 14110 place count 9115 transition count 13349
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 14117 place count 9115 transition count 13342
Free-agglomeration rule applied 2104 times with reduction of 516 identical transitions.
Iterating global reduction 8 with 2104 rules applied. Total rules applied 16221 place count 9115 transition count 10722
Reduce places removed 2104 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 240 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 242 transitions.
Graph (complete) has 14414 edges and 7011 vertex of which 6975 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.10 ms
Discarding 36 places :
Also discarding 0 output transitions
Iterating post reduction 8 with 2347 rules applied. Total rules applied 18568 place count 6975 transition count 10480
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 18573 place count 6970 transition count 10470
Iterating global reduction 9 with 5 rules applied. Total rules applied 18578 place count 6970 transition count 10470
Drop transitions (Redundant composition of simpler transitions.) removed 135 transitions
Redundant transition composition rules discarded 135 transitions
Iterating global reduction 9 with 135 rules applied. Total rules applied 18713 place count 6970 transition count 10335
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 18715 place count 6970 transition count 10335
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 18719 place count 6970 transition count 10335
Applied a total of 18719 rules in 13126 ms. Remains 6970 /16011 variables (removed 9041) and now considering 10335/25113 (removed 14778) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13143 ms. Remains : 6970/16011 places, 10335/25113 transitions.
RANDOM walk for 389552 steps (0 resets) in 120004 ms. (3 steps per ms) remains 30/5915 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5855 ms. (68 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5384 ms. (74 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5304 ms. (75 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5327 ms. (75 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5302 ms. (75 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5335 ms. (74 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5407 ms. (73 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5331 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5315 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5302 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5307 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5286 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5349 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5337 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5351 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5328 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5314 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5281 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5305 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5329 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5283 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5359 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5295 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5334 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5353 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5276 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5325 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5349 ms. (74 steps per ms) remains 28/28 properties
[2025-05-31 23:11:25] [INFO ] Flow matrix only has 10175 transitions (discarded 160 similar events)
// Phase 1: matrix 10175 rows 6970 cols
[2025-05-31 23:11:25] [INFO ] Computed 938 invariants in 34 ms
[2025-05-31 23:11:26] [INFO ] State equation strengthened by 1383 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 763/791 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/791 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 6179/6970 variables, 924/938 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6970 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 10175/17145 variables, 6970/7908 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17145 variables, 1383/9291 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17145 variables, 0/9291 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/17145 variables, 0/9291 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17145/17145 variables, and 9291 constraints, problems are : Problem set: 0 solved, 28 unsolved in 36041 ms.
Refiners :[Positive P Invariants (semi-flows): 938/938 constraints, State Equation: 6970/6970 constraints, ReadFeed: 1383/1383 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 763/791 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/791 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 6179/6970 variables, 924/938 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6970 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 10175/17145 variables, 6970/7908 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17145 variables, 1383/9291 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17145 variables, 28/9319 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17145 variables, 0/9319 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 17145/17145 variables, and 9319 constraints, problems are : Problem set: 0 solved, 28 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 938/938 constraints, State Equation: 6970/6970 constraints, ReadFeed: 1383/1383 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 81238ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 6970 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6970/6970 places, 10335/10335 transitions.
Graph (complete) has 14363 edges and 6970 vertex of which 3354 are kept as prefixes of interest. Removing 3616 places using SCC suffix rule.4 ms
Discarding 3616 places :
Also discarding 4906 output transitions
Drop transitions (Output transitions of discarded places.) removed 4906 transitions
Drop transitions (Empty/Sink Transition effects.) removed 576 transitions
Reduce isomorphic transitions removed 576 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1828 transitions
Trivial Post-agglo rules discarded 1828 transitions
Performed 1828 trivial Post agglomeration. Transition count delta: 1828
Iterating post reduction 0 with 2404 rules applied. Total rules applied 2405 place count 3354 transition count 3025
Reduce places removed 1828 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 1950 rules applied. Total rules applied 4355 place count 1526 transition count 2903
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 2 with 92 rules applied. Total rules applied 4447 place count 1466 transition count 2871
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 4463 place count 1450 transition count 2871
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 4463 place count 1450 transition count 2834
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 4537 place count 1413 transition count 2834
Discarding 444 places :
Symmetric choice reduction at 4 with 444 rule applications. Total rules 4981 place count 969 transition count 2364
Iterating global reduction 4 with 444 rules applied. Total rules applied 5425 place count 969 transition count 2364
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 385 transitions.
Iterating post reduction 4 with 385 rules applied. Total rules applied 5810 place count 969 transition count 1979
Performed 413 Post agglomeration using F-continuation condition with reduction of 43 identical transitions.
Deduced a syphon composed of 413 places in 1 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 5 with 826 rules applied. Total rules applied 6636 place count 556 transition count 1523
Drop transitions (Empty/Sink Transition effects.) removed 644 transitions
Reduce isomorphic transitions removed 644 transitions.
Graph (complete) has 1310 edges and 556 vertex of which 307 are kept as prefixes of interest. Removing 249 places using SCC suffix rule.1 ms
Discarding 249 places :
Also discarding 361 output transitions
Drop transitions (Output transitions of discarded places.) removed 361 transitions
Iterating post reduction 5 with 645 rules applied. Total rules applied 7281 place count 307 transition count 518
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 7321 place count 307 transition count 478
Discarding 152 places :
Symmetric choice reduction at 7 with 152 rule applications. Total rules 7473 place count 155 transition count 204
Iterating global reduction 7 with 152 rules applied. Total rules applied 7625 place count 155 transition count 204
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 7663 place count 136 transition count 185
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 7669 place count 136 transition count 179
Performed 24 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 7717 place count 112 transition count 190
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 8 with 46 rules applied. Total rules applied 7763 place count 112 transition count 144
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 7771 place count 104 transition count 129
Iterating global reduction 9 with 8 rules applied. Total rules applied 7779 place count 104 transition count 129
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 7789 place count 104 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 7799 place count 104 transition count 109
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 7803 place count 104 transition count 109
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 7807 place count 104 transition count 105
Applied a total of 7807 rules in 226 ms. Remains 104 /6970 variables (removed 6866) and now considering 105/10335 (removed 10230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 104/6970 places, 105/10335 transitions.
RANDOM walk for 1371 steps (0 resets) in 24 ms. (54 steps per ms) remains 0/28 properties
Able to resolve query StableMarking after proving 8241 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 199023 ms.
ITS solved all properties within timeout

BK_STOP 1748733167493

--------------------
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 StableMarking -timeout 180 -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="DLCflexbar-PT-5b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is DLCflexbar-PT-5b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860079800038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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