fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r484-smll-171624275300127
Last Updated
July 7, 2024

About the Execution of LTSMin+red for DLCround-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
420.760 17676.00 41960.00 757.90 FFFTTFTFTFTTFTFF normal

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-171624275300127.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-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275300127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 13 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 12:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 13 12:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K 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-03b-ReachabilityFireability-2024-00
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-01
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-02
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-03
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-04
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-05
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-06
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-07
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-08
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-09
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-10
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-11
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-12
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-13
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-14
FORMULA_NAME DLCround-PT-03b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717221112648

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:51:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:51:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:51:56] [INFO ] Load time of PNML (sax parser for PT used): 360 ms
[2024-06-01 05:51:56] [INFO ] Transformed 1383 places.
[2024-06-01 05:51:56] [INFO ] Transformed 1887 transitions.
[2024-06-01 05:51:56] [INFO ] Found NUPN structural information;
[2024-06-01 05:51:56] [INFO ] Parsed PT model containing 1383 places and 1887 transitions and 4809 arcs in 665 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2642 ms. (15 steps per ms) remains 7/16 properties
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 623 ms. (64 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1265 ms. (31 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 339 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 6/7 properties
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 6/6 properties
// Phase 1: matrix 1887 rows 1383 cols
[2024-06-01 05:51:58] [INFO ] Computed 52 invariants in 57 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem DLCround-PT-03b-ReachabilityFireability-2024-01 is UNSAT
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1202/1383 variables, 52/233 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1383 variables, 1202/1435 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1383 variables, 0/1435 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1887/3270 variables, 1383/2818 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3270 variables, 0/2818 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/3270 variables, 0/2818 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3270/3270 variables, and 2818 constraints, problems are : Problem set: 1 solved, 5 unsolved in 3421 ms.
Refiners :[Domain max(s): 1383/1383 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 1383/1383 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1225/1383 variables, 52/210 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1383 variables, 1225/1435 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 05:52:04] [INFO ] Deduced a trap composed of 120 places in 472 ms of which 78 ms to minimize.
[2024-06-01 05:52:04] [INFO ] Deduced a trap composed of 141 places in 364 ms of which 8 ms to minimize.
[2024-06-01 05:52:04] [INFO ] Deduced a trap composed of 136 places in 299 ms of which 7 ms to minimize.
[2024-06-01 05:52:05] [INFO ] Deduced a trap composed of 128 places in 274 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1383 variables, 4/1439 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1383 variables, 0/1439 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1887/3270 variables, 1383/2822 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3270 variables, 5/2827 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3270/3270 variables, and 2827 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5020 ms.
Refiners :[Domain max(s): 1383/1383 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 1383/1383 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 8891ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 158 out of 1383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1383/1383 places, 1887/1887 transitions.
Graph (trivial) has 1031 edges and 1383 vertex of which 81 / 1383 are part of one of the 11 SCC in 12 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1313 transition count 1306
Reduce places removed 500 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 518 rules applied. Total rules applied 1019 place count 813 transition count 1288
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 2 with 69 rules applied. Total rules applied 1088 place count 805 transition count 1227
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 65 rules applied. Total rules applied 1153 place count 745 transition count 1222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1154 place count 744 transition count 1222
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 59 Pre rules applied. Total rules applied 1154 place count 744 transition count 1163
Deduced a syphon composed of 59 places in 4 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 1272 place count 685 transition count 1163
Discarding 125 places :
Symmetric choice reduction at 5 with 125 rule applications. Total rules 1397 place count 560 transition count 1038
Iterating global reduction 5 with 125 rules applied. Total rules applied 1522 place count 560 transition count 1038
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 9 rules applied. Total rules applied 1531 place count 560 transition count 1029
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 1535 place count 558 transition count 1027
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1536 place count 557 transition count 1027
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 32 Pre rules applied. Total rules applied 1536 place count 557 transition count 995
Deduced a syphon composed of 32 places in 8 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 1600 place count 525 transition count 995
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1606 place count 519 transition count 965
Iterating global reduction 8 with 6 rules applied. Total rules applied 1612 place count 519 transition count 965
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1614 place count 519 transition count 963
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 2 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 9 with 184 rules applied. Total rules applied 1798 place count 427 transition count 871
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1799 place count 427 transition count 870
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1801 place count 425 transition count 856
Iterating global reduction 10 with 2 rules applied. Total rules applied 1803 place count 425 transition count 856
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -188
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 10 with 68 rules applied. Total rules applied 1871 place count 391 transition count 1044
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 1889 place count 391 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1890 place count 390 transition count 1016
Iterating global reduction 11 with 1 rules applied. Total rules applied 1891 place count 390 transition count 1016
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 1903 place count 390 transition count 1004
Free-agglomeration rule applied 47 times with reduction of 4 identical transitions.
Iterating global reduction 11 with 47 rules applied. Total rules applied 1950 place count 390 transition count 953
Reduce places removed 47 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 64 rules applied. Total rules applied 2014 place count 343 transition count 936
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 12 with 16 rules applied. Total rules applied 2030 place count 343 transition count 920
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 2039 place count 343 transition count 920
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 2042 place count 343 transition count 917
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2043 place count 343 transition count 917
Applied a total of 2043 rules in 701 ms. Remains 343 /1383 variables (removed 1040) and now considering 917/1887 (removed 970) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 343/1383 places, 917/1887 transitions.
RANDOM walk for 40000 steps (8 resets) in 983 ms. (40 steps per ms) remains 2/5 properties
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 331 ms. (120 steps per ms) remains 1/2 properties
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-01 05:52:08] [INFO ] Flow matrix only has 795 transitions (discarded 122 similar events)
// Phase 1: matrix 795 rows 343 cols
[2024-06-01 05:52:08] [INFO ] Computed 52 invariants in 5 ms
[2024-06-01 05:52:08] [INFO ] State equation strengthened by 115 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 292/333 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/343 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 795/1138 variables, 343/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1138 variables, 115/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1138 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1138 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 343/343 constraints, ReadFeed: 115/115 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 292/333 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/343 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 795/1138 variables, 343/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1138 variables, 115/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1138 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1138 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1138 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 343/343 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1187ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 375 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=75 )
FORMULA DLCround-PT-03b-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 20 ms.
All properties solved without resorting to model-checking.
Total runtime 14364 ms.
ITS solved all properties within timeout

BK_STOP 1717221130324

--------------------
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 ReachabilityFireability -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-03b"
export BK_EXAMINATION="ReachabilityFireability"
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-03b, examination is ReachabilityFireability"
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-171624275300127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-03b.tgz
mv DLCround-PT-03b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;