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

About the Execution of GreatSPN+red for DLCround-PT-11b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
627.596 19501.00 47168.00 269.00 TFFFFTFTTTFTTTFT 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.r113-smll-171624274500254.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 DLCround-PT-11b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274500254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K 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 55K 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.8K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 13 12:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 12:11 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 1.7M 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-11b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-11b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716403629600

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-11b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 18:47:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 18:47:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:47:13] [INFO ] Load time of PNML (sax parser for PT used): 780 ms
[2024-05-22 18:47:13] [INFO ] Transformed 4375 places.
[2024-05-22 18:47:13] [INFO ] Transformed 6991 transitions.
[2024-05-22 18:47:13] [INFO ] Found NUPN structural information;
[2024-05-22 18:47:13] [INFO ] Parsed PT model containing 4375 places and 6991 transitions and 19673 arcs in 1458 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2451 ms. (16 steps per ms) remains 6/13 properties
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 580 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1384 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
// Phase 1: matrix 6991 rows 4375 cols
[2024-05-22 18:47:16] [INFO ] Computed 244 invariants in 93 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 4150/4305 variables, 237/392 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4305 variables, 4150/4542 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4305 variables, 0/4542 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 70/4375 variables, 7/4549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4375 variables, 70/4619 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4375 variables, 0/4619 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5515ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 155 out of 4375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4375/4375 places, 6991/6991 transitions.
Graph (trivial) has 3737 edges and 4375 vertex of which 493 / 4375 are part of one of the 50 SCC in 33 ms
Free SCC test removed 443 places
Drop transitions (Empty/Sink Transition effects.) removed 503 transitions
Reduce isomorphic transitions removed 503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1540 transitions
Trivial Post-agglo rules discarded 1540 transitions
Performed 1540 trivial Post agglomeration. Transition count delta: 1540
Iterating post reduction 0 with 1540 rules applied. Total rules applied 1541 place count 3932 transition count 4948
Reduce places removed 1540 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 1614 rules applied. Total rules applied 3155 place count 2392 transition count 4874
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 37 rules applied. Total rules applied 3192 place count 2360 transition count 4869
Reduce places removed 2 places and 0 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 3 with 64 rules applied. Total rules applied 3256 place count 2358 transition count 4807
Reduce places removed 62 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 4 with 64 rules applied. Total rules applied 3320 place count 2296 transition count 4805
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3321 place count 2295 transition count 4805
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 38 Pre rules applied. Total rules applied 3321 place count 2295 transition count 4767
Deduced a syphon composed of 38 places in 60 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 3397 place count 2257 transition count 4767
Discarding 509 places :
Symmetric choice reduction at 6 with 509 rule applications. Total rules 3906 place count 1748 transition count 4258
Iterating global reduction 6 with 509 rules applied. Total rules applied 4415 place count 1748 transition count 4258
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 2 rules applied. Total rules applied 4417 place count 1748 transition count 4256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4418 place count 1747 transition count 4256
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 196 Pre rules applied. Total rules applied 4418 place count 1747 transition count 4060
Deduced a syphon composed of 196 places in 36 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 8 with 392 rules applied. Total rules applied 4810 place count 1551 transition count 4060
Discarding 45 places :
Symmetric choice reduction at 8 with 45 rule applications. Total rules 4855 place count 1506 transition count 3400
Iterating global reduction 8 with 45 rules applied. Total rules applied 4900 place count 1506 transition count 3400
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 4910 place count 1506 transition count 3390
Performed 380 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 380 places in 4 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 9 with 760 rules applied. Total rules applied 5670 place count 1126 transition count 3004
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 5672 place count 1126 transition count 3002
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 5683 place count 1115 transition count 2837
Iterating global reduction 10 with 11 rules applied. Total rules applied 5694 place count 1115 transition count 2837
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 5695 place count 1115 transition count 2836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -947
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 11 with 194 rules applied. Total rules applied 5889 place count 1018 transition count 3783
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 11 with 153 rules applied. Total rules applied 6042 place count 1018 transition count 3630
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 6051 place count 1009 transition count 3323
Iterating global reduction 12 with 9 rules applied. Total rules applied 6060 place count 1009 transition count 3323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 6063 place count 1009 transition count 3320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 6065 place count 1008 transition count 3332
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 6067 place count 1008 transition count 3330
Drop transitions (Redundant composition of simpler transitions.) removed 171 transitions
Redundant transition composition rules discarded 171 transitions
Iterating global reduction 14 with 171 rules applied. Total rules applied 6238 place count 1008 transition count 3159
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 6244 place count 1002 transition count 3042
Iterating global reduction 14 with 6 rules applied. Total rules applied 6250 place count 1002 transition count 3042
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 6256 place count 1002 transition count 3036
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 6257 place count 1002 transition count 3035
Free-agglomeration rule applied 379 times with reduction of 123 identical transitions.
Iterating global reduction 15 with 379 rules applied. Total rules applied 6636 place count 1002 transition count 2533
Reduce places removed 379 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 474 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 493 transitions.
Iterating post reduction 15 with 872 rules applied. Total rules applied 7508 place count 623 transition count 2040
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 7514 place count 617 transition count 2011
Iterating global reduction 16 with 6 rules applied. Total rules applied 7520 place count 617 transition count 2011
Drop transitions (Redundant composition of simpler transitions.) removed 185 transitions
Redundant transition composition rules discarded 185 transitions
Iterating global reduction 16 with 185 rules applied. Total rules applied 7705 place count 617 transition count 1826
Discarding 32 places :
Symmetric choice reduction at 16 with 32 rule applications. Total rules 7737 place count 585 transition count 1717
Iterating global reduction 16 with 32 rules applied. Total rules applied 7769 place count 585 transition count 1717
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 7771 place count 584 transition count 1718
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 7772 place count 584 transition count 1717
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 16 with 12 rules applied. Total rules applied 7784 place count 583 transition count 1706
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 7787 place count 583 transition count 1765
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 17 with 36 rules applied. Total rules applied 7823 place count 580 transition count 1732
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 18 with 28 rules applied. Total rules applied 7851 place count 580 transition count 1704
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 18 with 17 rules applied. Total rules applied 7868 place count 580 transition count 1704
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 7872 place count 580 transition count 1700
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 7873 place count 580 transition count 1700
Applied a total of 7873 rules in 2525 ms. Remains 580 /4375 variables (removed 3795) and now considering 1700/6991 (removed 5291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2546 ms. Remains : 580/4375 places, 1700/6991 transitions.
RANDOM walk for 40000 steps (8 resets) in 1113 ms. (35 steps per ms) remains 3/6 properties
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
[2024-05-22 18:47:24] [INFO ] Flow matrix only has 1029 transitions (discarded 671 similar events)
// Phase 1: matrix 1029 rows 580 cols
[2024-05-22 18:47:24] [INFO ] Computed 207 invariants in 19 ms
[2024-05-22 18:47:24] [INFO ] State equation strengthened by 191 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 465/564 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/580 variables, 8/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1029/1609 variables, 580/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1609 variables, 191/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1609 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1609 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1609/1609 variables, and 978 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1123 ms.
Refiners :[Positive P Invariants (semi-flows): 207/207 constraints, State Equation: 580/580 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 465/564 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/580 variables, 8/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1029/1609 variables, 580/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1609 variables, 191/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1609 variables, 3/981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 18:47:27] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 22 ms to minimize.
[2024-05-22 18:47:27] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 18:47:27] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1609 variables, 3/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1609 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1609 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1609/1609 variables, and 984 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3040 ms.
Refiners :[Positive P Invariants (semi-flows): 207/207 constraints, State Equation: 580/580 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 4300ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 10714 steps, including 62 resets, run visited all 3 properties in 102 ms. (steps per millisecond=105 )
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA DLCround-PT-11b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 113 ms.
All properties solved without resorting to model-checking.
Total runtime 16881 ms.
ITS solved all properties within timeout

BK_STOP 1716403649101

--------------------
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-11b"
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 DLCround-PT-11b, 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-171624274500254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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