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.r113-smll-171624274000014.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 greatspnxred
Input is DLCflexbar-PT-2b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274000014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:42 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 DLCflexbar-PT-2b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCflexbar-PT-2b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716298720887

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-2b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:38:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 13:38:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:38:44] [INFO ] Load time of PNML (sax parser for PT used): 857 ms
[2024-05-21 13:38:44] [INFO ] Transformed 4456 places.
[2024-05-21 13:38:44] [INFO ] Transformed 6272 transitions.
[2024-05-21 13:38:44] [INFO ] Found NUPN structural information;
[2024-05-21 13:38:44] [INFO ] Parsed PT model containing 4456 places and 6272 transitions and 16411 arcs in 1213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2872 ms. (13 steps per ms) remains 2/12 properties
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
// Phase 1: matrix 6272 rows 4456 cols
[2024-05-21 13:38:46] [INFO ] Computed 196 invariants in 82 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2352/2394 variables, 49/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2394 variables, 2352/2443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2394 variables, 0/2443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2062/4456 variables, 147/2590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4456 variables, 2062/4652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4456 variables, 0/4652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5375ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 4456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4456/4456 places, 6272/6272 transitions.
Graph (trivial) has 4165 edges and 4456 vertex of which 492 / 4456 are part of one of the 36 SCC in 31 ms
Free SCC test removed 456 places
Drop transitions (Empty/Sink Transition effects.) removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2048 transitions
Trivial Post-agglo rules discarded 2048 transitions
Performed 2048 trivial Post agglomeration. Transition count delta: 2048
Iterating post reduction 0 with 2048 rules applied. Total rules applied 2049 place count 4000 transition count 3709
Reduce places removed 2048 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 1 with 2188 rules applied. Total rules applied 4237 place count 1952 transition count 3569
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 108 rules applied. Total rules applied 4345 place count 1884 transition count 3529
Reduce places removed 20 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 3 with 49 rules applied. Total rules applied 4394 place count 1864 transition count 3500
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 4423 place count 1835 transition count 3500
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 4423 place count 1835 transition count 3471
Deduced a syphon composed of 29 places in 31 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 4481 place count 1806 transition count 3471
Discarding 478 places :
Symmetric choice reduction at 5 with 478 rule applications. Total rules 4959 place count 1328 transition count 2993
Iterating global reduction 5 with 478 rules applied. Total rules applied 5437 place count 1328 transition count 2993
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 180 Pre rules applied. Total rules applied 5437 place count 1328 transition count 2813
Deduced a syphon composed of 180 places in 31 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 5 with 360 rules applied. Total rules applied 5797 place count 1148 transition count 2813
Discarding 57 places :
Symmetric choice reduction at 5 with 57 rule applications. Total rules 5854 place count 1091 transition count 2129
Iterating global reduction 5 with 57 rules applied. Total rules applied 5911 place count 1091 transition count 2129
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 5947 place count 1091 transition count 2093
Performed 277 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 277 places in 1 ms
Reduce places removed 277 places and 0 transitions.
Iterating global reduction 6 with 554 rules applied. Total rules applied 6501 place count 814 transition count 1812
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 6504 place count 814 transition count 1809
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 6506 place count 812 transition count 1763
Iterating global reduction 7 with 2 rules applied. Total rules applied 6508 place count 812 transition count 1763
Performed 77 Post agglomeration using F-continuation condition with reduction of 52 identical transitions.
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 7 with 154 rules applied. Total rules applied 6662 place count 735 transition count 2120
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 6706 place count 735 transition count 2076
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 6721 place count 720 transition count 1947
Iterating global reduction 8 with 15 rules applied. Total rules applied 6736 place count 720 transition count 1947
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 6784 place count 720 transition count 1899
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 9 with 43 rules applied. Total rules applied 6827 place count 720 transition count 1856
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 6833 place count 714 transition count 1850
Iterating global reduction 9 with 6 rules applied. Total rules applied 6839 place count 714 transition count 1850
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 6845 place count 708 transition count 1704
Iterating global reduction 9 with 6 rules applied. Total rules applied 6851 place count 708 transition count 1704
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 6857 place count 708 transition count 1698
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 6865 place count 704 transition count 1694
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 6869 place count 700 transition count 1598
Iterating global reduction 10 with 4 rules applied. Total rules applied 6873 place count 700 transition count 1598
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 6877 place count 700 transition count 1594
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 6881 place count 698 transition count 1615
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 6883 place count 698 transition count 1613
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 6886 place count 698 transition count 1610
Free-agglomeration rule applied 377 times with reduction of 210 identical transitions.
Iterating global reduction 12 with 377 rules applied. Total rules applied 7263 place count 698 transition count 1023
Reduce places removed 377 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 409 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 414 transitions.
Graph (complete) has 849 edges and 321 vertex of which 292 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.2 ms
Discarding 29 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Iterating post reduction 12 with 792 rules applied. Total rules applied 8055 place count 292 transition count 591
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 8061 place count 292 transition count 585
Discarding 55 places :
Symmetric choice reduction at 14 with 55 rule applications. Total rules 8116 place count 237 transition count 487
Iterating global reduction 14 with 55 rules applied. Total rules applied 8171 place count 237 transition count 487
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 14 with 44 rules applied. Total rules applied 8215 place count 237 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 8216 place count 236 transition count 443
Discarding 15 places :
Symmetric choice reduction at 15 with 15 rule applications. Total rules 8231 place count 221 transition count 420
Iterating global reduction 15 with 15 rules applied. Total rules applied 8246 place count 221 transition count 420
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 8247 place count 221 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 8248 place count 220 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 8249 place count 220 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 8250 place count 219 transition count 418
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 8252 place count 219 transition count 433
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 17 with 19 rules applied. Total rules applied 8271 place count 217 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 8273 place count 217 transition count 414
Applied a total of 8273 rules in 2493 ms. Remains 217 /4456 variables (removed 4239) and now considering 414/6272 (removed 5858) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2529 ms. Remains : 217/4456 places, 414/6272 transitions.
RANDOM walk for 40000 steps (8 resets) in 1679 ms. (23 steps per ms) remains 1/2 properties
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 1/1 properties
[2024-05-21 13:38:54] [INFO ] Flow matrix only has 276 transitions (discarded 138 similar events)
// Phase 1: matrix 276 rows 217 cols
[2024-05-21 13:38:54] [INFO ] Computed 98 invariants in 6 ms
[2024-05-21 13:38:54] [INFO ] State equation strengthened by 109 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/127 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/217 variables, 59/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 276/493 variables, 217/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 109/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/493 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 424 constraints, problems are : Problem set: 0 solved, 1 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 98/98 constraints, State Equation: 217/217 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/127 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/217 variables, 59/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 276/493 variables, 217/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 109/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/493 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 98/98 constraints, State Equation: 217/217 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1737ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
FORMULA DLCflexbar-PT-2b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 16 ms.
All properties solved without resorting to model-checking.
Total runtime 13087 ms.
ITS solved all properties within timeout

BK_STOP 1716298736743

--------------------
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="DLCflexbar-PT-2b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DLCflexbar-PT-2b, 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 r113-smll-171624274000014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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