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.r575-smll-171734919800183.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 MedleyA-PT-23, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919800183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 150K Jun 2 16:33 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 MedleyA-PT-23-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-23-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717391989427

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 05:19:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-03 05:19:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 05:19:52] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-06-03 05:19:52] [INFO ] Transformed 378 places.
[2024-06-03 05:19:52] [INFO ] Transformed 614 transitions.
[2024-06-03 05:19:52] [INFO ] Found NUPN structural information;
[2024-06-03 05:19:52] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 3189 ms. (12 steps per ms) remains 9/16 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (47 resets) in 320 ms. (124 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (11 resets) in 490 ms. (81 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (43 resets) in 235 ms. (169 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (18 resets) in 246 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (33 resets) in 522 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (18 resets) in 777 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (35 resets) in 431 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
// Phase 1: matrix 614 rows 378 cols
[2024-06-03 05:19:55] [INFO ] Computed 11 invariants in 45 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2024-13 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 210/293 variables, 9/92 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 210/302 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 85/378 variables, 2/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 85/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/992 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 767 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1630 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 242/284 variables, 9/51 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 242/293 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem MedleyA-PT-23-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 94/378 variables, 2/295 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 94/389 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/992 variables, 4/771 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-03 05:19:58] [INFO ] Deduced a trap composed of 130 places in 253 ms of which 44 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/992 variables, 1/772 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/992 variables, 0/772 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/992 variables, 0/772 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 772 constraints, problems are : Problem set: 3 solved, 4 unsolved in 2625 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 4677ms problems are : Problem set: 3 solved, 4 unsolved
Parikh walk visited 0 properties in 1565 ms.
Support contains 39 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 614/614 transitions.
Graph (trivial) has 253 edges and 378 vertex of which 23 / 378 are part of one of the 2 SCC in 5 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (complete) has 1055 edges and 357 vertex of which 354 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 354 transition count 505
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 86 rules applied. Total rules applied 169 place count 276 transition count 497
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 175 place count 270 transition count 497
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 175 place count 270 transition count 475
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 219 place count 248 transition count 475
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 296 place count 171 transition count 398
Iterating global reduction 3 with 77 rules applied. Total rules applied 373 place count 171 transition count 398
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 375 place count 171 transition count 396
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 375 place count 171 transition count 391
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 385 place count 166 transition count 391
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 409 place count 142 transition count 319
Iterating global reduction 4 with 24 rules applied. Total rules applied 433 place count 142 transition count 319
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 440 place count 142 transition count 312
Reduce places removed 1 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 5 with 3 rules applied. Total rules applied 443 place count 141 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 444 place count 140 transition count 310
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 446 place count 138 transition count 306
Iterating global reduction 7 with 2 rules applied. Total rules applied 448 place count 138 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 449 place count 138 transition count 305
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 477 place count 124 transition count 291
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 491 place count 117 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 497 place count 117 transition count 297
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 498 place count 116 transition count 294
Iterating global reduction 8 with 1 rules applied. Total rules applied 499 place count 116 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 500 place count 116 transition count 293
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 519 place count 116 transition count 274
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 538 place count 97 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 542 place count 97 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 543 place count 96 transition count 269
Applied a total of 543 rules in 236 ms. Remains 96 /378 variables (removed 282) and now considering 269/614 (removed 345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 96/378 places, 269/614 transitions.
RANDOM walk for 40000 steps (35 resets) in 1214 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (27 resets) in 149 ms. (266 steps per ms) remains 3/4 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (35 resets) in 174 ms. (228 steps per ms) remains 2/3 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (17 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 89 ms. (444 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-03 05:20:02] [INFO ] Flow matrix only has 264 transitions (discarded 5 similar events)
// Phase 1: matrix 264 rows 96 cols
[2024-06-03 05:20:02] [INFO ] Computed 11 invariants in 4 ms
[2024-06-03 05:20:02] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/82 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/85 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/96 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 264/360 variables, 96/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 2/2 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/82 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/85 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/96 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 264/360 variables, 96/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/360 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 95 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
FORMULA MedleyA-PT-23-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 10674 ms.
ITS solved all properties within timeout

BK_STOP 1717392002728

--------------------
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="MedleyA-PT-23"
export BK_EXAMINATION="ReachabilityFireability"
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 MedleyA-PT-23, 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 r575-smll-171734919800183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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