fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654446000463
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBNT-PT-S05J40

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3895.735 64256.00 109384.00 104.90 FTFTTFFTTFTTFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654446000463.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-PT-S05J40, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 17K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Apr 12 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 346K Apr 12 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 438K Apr 12 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 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 PolyORBNT-PT-S05J40-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716887084251

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:04:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 09:04:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:04:46] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2024-05-28 09:04:46] [INFO ] Transformed 629 places.
[2024-05-28 09:04:46] [INFO ] Transformed 1590 transitions.
[2024-05-28 09:04:46] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 510 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 226 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 09:04:46] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 09:04:46] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 09:04:46] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 09:04:46] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 09:04:46] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 09:04:46] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2775 resets) in 2796 ms. (14 steps per ms) remains 9/16 properties
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (997 resets) in 428 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1002 resets) in 5029 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (73 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (503 resets) in 489 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (601 resets) in 453 ms. (88 steps per ms) remains 8/9 properties
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (406 resets) in 354 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (77 resets) in 904 ms. (44 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (76 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
[2024-05-28 09:04:50] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-05-28 09:04:50] [INFO ] Computed 102 invariants in 113 ms
[2024-05-28 09:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2024-03 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 61/625 variables, 52/81 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2024-08 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2024-10 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/625 variables, 20/101 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/625 variables, 0/101 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 4/629 variables, 1/102 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/102 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/1560 variables, and 731 constraints, problems are : Problem set: 7 solved, 1 unsolved in 2295 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 297/357 variables, 37/38 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 3/41 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/41 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 107/464 variables, 19/60 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/60 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/524 variables, 12/72 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/72 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 98/622 variables, 23/95 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 0/95 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/629 variables, 7/102 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/102 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/1560 variables, and 731 constraints, problems are : Problem set: 7 solved, 1 unsolved in 1907 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 7083ms problems are : Problem set: 7 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 624 transition count 901
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 74 place count 590 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 589 transition count 900
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 75 place count 589 transition count 860
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 155 place count 549 transition count 860
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 548 transition count 859
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 548 transition count 859
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 547 transition count 858
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 547 transition count 857
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 161 place count 546 transition count 857
Applied a total of 161 rules in 677 ms. Remains 546 /629 variables (removed 83) and now considering 857/935 (removed 78) transitions.
Running 851 sub problems to find dead transitions.
[2024-05-28 09:04:58] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 546 cols
[2024-05-28 09:04:58] [INFO ] Computed 97 invariants in 54 ms
[2024-05-28 09:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/541 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-05-28 09:05:10] [INFO ] Deduced a trap composed of 16 places in 315 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/541 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/1399 variables, and 93 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 17/22 constraints, State Equation: 0/546 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/541 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/541 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-05-28 09:05:22] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-28 09:05:29] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/1399 variables, and 95 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 17/22 constraints, State Equation: 0/546 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/851 constraints, Known Traps: 3/3 constraints]
After SMT, in 42366ms problems are : Problem set: 0 solved, 851 unsolved
Search for dead transitions found 0 dead transitions in 42389ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43123 ms. Remains : 546/629 places, 857/935 transitions.
RANDOM walk for 40001 steps (2227 resets) in 857 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (177 resets) in 741 ms. (53 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 242963 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 242963 steps, saw 72708 distinct states, run finished after 3009 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-28 09:05:44] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-05-28 09:05:44] [INFO ] Invariant cache hit.
[2024-05-28 09:05:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 257/317 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 83/400 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/460 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/539 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/546 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 853/1399 variables, 546/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1399 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1399 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1399 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1399/1399 variables, and 644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 546/546 constraints, ReadFeed: 1/1 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 257/317 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 83/400 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/460 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/539 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/546 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 853/1399 variables, 546/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1399 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1399 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1399 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1399 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1399/1399 variables, and 645 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3390 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 546/546 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4196ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=5 )
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
All properties solved without resorting to model-checking.
Total runtime 62640 ms.
ITS solved all properties within timeout

BK_STOP 1716887148507

--------------------
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:
++ 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
++ sed s/.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="PolyORBNT-PT-S05J40"
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 PolyORBNT-PT-S05J40, 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 r289-tajo-171654446000463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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