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.r484-smll-171624275700286.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 DLCround-PT-13b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275700286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 3.5K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 12:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 13 12:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 13 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 13 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M 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 DLCround-PT-13b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717239472894

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-13b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:57:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:57:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:57:56] [INFO ] Load time of PNML (sax parser for PT used): 1527 ms
[2024-06-01 10:57:56] [INFO ] Transformed 5343 places.
[2024-06-01 10:57:56] [INFO ] Transformed 8727 transitions.
[2024-06-01 10:57:56] [INFO ] Found NUPN structural information;
[2024-06-01 10:57:57] [INFO ] Parsed PT model containing 5343 places and 8727 transitions and 24849 arcs in 2052 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 55 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2575 ms. (15 steps per ms) remains 2/11 properties
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 770 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
// Phase 1: matrix 8727 rows 5343 cols
[2024-06-01 10:57:59] [INFO ] Computed 312 invariants in 120 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 3609/3663 variables, 166/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3663 variables, 3609/3829 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3663 variables, 0/3829 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1680/5343 variables, 146/3975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5343 variables, 1680/5655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5343 variables, 0/5655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5515ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 5343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4783 edges and 5343 vertex of which 811 / 5343 are part of one of the 60 SCC in 27 ms
Free SCC test removed 751 places
Drop transitions (Empty/Sink Transition effects.) removed 840 transitions
Reduce isomorphic transitions removed 840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1853 transitions
Trivial Post-agglo rules discarded 1853 transitions
Performed 1853 trivial Post agglomeration. Transition count delta: 1853
Iterating post reduction 0 with 1853 rules applied. Total rules applied 1854 place count 4592 transition count 6034
Reduce places removed 1853 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 1945 rules applied. Total rules applied 3799 place count 2739 transition count 5942
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 45 rules applied. Total rules applied 3844 place count 2700 transition count 5936
Reduce places removed 3 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 3 with 22 rules applied. Total rules applied 3866 place count 2697 transition count 5917
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 3885 place count 2678 transition count 5917
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 3885 place count 2678 transition count 5892
Deduced a syphon composed of 25 places in 114 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 3935 place count 2653 transition count 5892
Discarding 717 places :
Symmetric choice reduction at 5 with 717 rule applications. Total rules 4652 place count 1936 transition count 5175
Iterating global reduction 5 with 717 rules applied. Total rules applied 5369 place count 1936 transition count 5175
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 308 Pre rules applied. Total rules applied 5369 place count 1936 transition count 4867
Deduced a syphon composed of 308 places in 47 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 5 with 616 rules applied. Total rules applied 5985 place count 1628 transition count 4867
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 6085 place count 1528 transition count 3188
Iterating global reduction 5 with 100 rules applied. Total rules applied 6185 place count 1528 transition count 3188
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 6218 place count 1528 transition count 3155
Performed 396 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 396 places in 2 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 6 with 792 rules applied. Total rules applied 7010 place count 1132 transition count 2745
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 7023 place count 1132 transition count 2732
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 7024 place count 1131 transition count 2715
Iterating global reduction 7 with 1 rules applied. Total rules applied 7025 place count 1131 transition count 2715
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -476
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 7143 place count 1072 transition count 3191
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 7 with 58 rules applied. Total rules applied 7201 place count 1072 transition count 3133
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 7204 place count 1069 transition count 3043
Iterating global reduction 8 with 3 rules applied. Total rules applied 7207 place count 1069 transition count 3043
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 7210 place count 1069 transition count 3040
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 7214 place count 1067 transition count 3065
Drop transitions (Redundant composition of simpler transitions.) removed 93 transitions
Redundant transition composition rules discarded 93 transitions
Iterating global reduction 9 with 93 rules applied. Total rules applied 7307 place count 1067 transition count 2972
Discarding 24 places :
Symmetric choice reduction at 9 with 24 rule applications. Total rules 7331 place count 1043 transition count 2948
Iterating global reduction 9 with 24 rules applied. Total rules applied 7355 place count 1043 transition count 2948
Discarding 24 places :
Symmetric choice reduction at 9 with 24 rule applications. Total rules 7379 place count 1019 transition count 2472
Iterating global reduction 9 with 24 rules applied. Total rules applied 7403 place count 1019 transition count 2472
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 9 with 24 rules applied. Total rules applied 7427 place count 1019 transition count 2448
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 7457 place count 1004 transition count 2433
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 7471 place count 990 transition count 2157
Iterating global reduction 10 with 14 rules applied. Total rules applied 7485 place count 990 transition count 2157
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 7498 place count 990 transition count 2144
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 7499 place count 990 transition count 2143
Free-agglomeration rule applied 521 times with reduction of 231 identical transitions.
Iterating global reduction 11 with 521 rules applied. Total rules applied 8020 place count 990 transition count 1391
Reduce places removed 521 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 619 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 626 transitions.
Graph (complete) has 1055 edges and 469 vertex of which 348 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.2 ms
Discarding 121 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1148 rules applied. Total rules applied 9168 place count 348 transition count 765
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 12 with 95 rules applied. Total rules applied 9263 place count 348 transition count 670
Discarding 105 places :
Symmetric choice reduction at 13 with 105 rule applications. Total rules 9368 place count 243 transition count 510
Iterating global reduction 13 with 105 rules applied. Total rules applied 9473 place count 243 transition count 510
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 9477 place count 241 transition count 528
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 9497 place count 241 transition count 508
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 9541 place count 241 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 607 edges and 240 vertex of which 232 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 2 rules applied. Total rules applied 9543 place count 232 transition count 464
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 15 with 15 rules applied. Total rules applied 9558 place count 232 transition count 449
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 9561 place count 229 transition count 443
Iterating global reduction 16 with 3 rules applied. Total rules applied 9564 place count 229 transition count 443
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 9566 place count 229 transition count 443
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 9567 place count 229 transition count 442
Applied a total of 9567 rules in 2953 ms. Remains 229 /5343 variables (removed 5114) and now considering 442/8727 (removed 8285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2970 ms. Remains : 229/5343 places, 442/8727 transitions.
RANDOM walk for 40000 steps (8 resets) in 883 ms. (45 steps per ms) remains 1/2 properties
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1335 ms. (29 steps per ms) remains 1/1 properties
[2024-06-01 10:58:08] [INFO ] Flow matrix only has 319 transitions (discarded 123 similar events)
// Phase 1: matrix 319 rows 229 cols
[2024-06-01 10:58:08] [INFO ] Computed 96 invariants in 10 ms
[2024-06-01 10:58:08] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 145/198 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/223 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 319/542 variables, 223/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 88/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/548 variables, 6/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 413 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, State Equation: 229/229 constraints, ReadFeed: 88/88 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 145/198 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/223 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 319/542 variables, 223/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 88/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/548 variables, 6/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/548 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, State Equation: 229/229 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1164ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 175 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=58 )
FORMULA DLCround-PT-13b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
All properties solved without resorting to model-checking.
Total runtime 14377 ms.
ITS solved all properties within timeout

BK_STOP 1717239489452

--------------------
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="DLCround-PT-13b"
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 DLCround-PT-13b, 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 r484-smll-171624275700286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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