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.r179-tall-171640600800095.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 FlexibleBarrier-PT-14b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600800095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 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 726K 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 FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716421927178

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 23:52:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 23:52:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:52:08] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-22 23:52:08] [INFO ] Transformed 2678 places.
[2024-05-22 23:52:08] [INFO ] Transformed 3085 transitions.
[2024-05-22 23:52:08] [INFO ] Found NUPN structural information;
[2024-05-22 23:52:08] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (408 resets) in 2399 ms. (16 steps per ms) remains 11/16 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (34 resets) in 215 ms. (185 steps per ms) remains 9/11 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (36 resets) in 294 ms. (135 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (21 resets) in 136 ms. (292 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (38 resets) in 1197 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (39 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (37 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (35 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
// Phase 1: matrix 3085 rows 2678 cols
[2024-05-22 23:52:10] [INFO ] Computed 16 invariants in 73 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2543/2678 variables, 16/151 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2678 variables, 2543/2694 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2678 variables, 0/2694 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3085/5763 variables, 2678/5372 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5763 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/5763 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5763/5763 variables, and 5372 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3758 ms.
Refiners :[Domain max(s): 2678/2678 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 2678/2678 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06 is UNSAT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2543/2678 variables, 16/151 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2678 variables, 2543/2694 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-22 23:52:16] [INFO ] Deduced a trap composed of 930 places in 1380 ms of which 114 ms to minimize.
[2024-05-22 23:52:17] [INFO ] Deduced a trap composed of 924 places in 1251 ms of which 14 ms to minimize.
[2024-05-22 23:52:18] [INFO ] Deduced a trap composed of 893 places in 1098 ms of which 13 ms to minimize.
[2024-05-22 23:52:20] [INFO ] Deduced a trap composed of 968 places in 1198 ms of which 14 ms to minimize.
SMT process timed out in 9827ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 131 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 1919 edges and 2678 vertex of which 38 / 2678 are part of one of the 6 SCC in 15 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 446 transitions
Trivial Post-agglo rules discarded 446 transitions
Performed 446 trivial Post agglomeration. Transition count delta: 446
Iterating post reduction 0 with 446 rules applied. Total rules applied 447 place count 2646 transition count 2600
Reduce places removed 446 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 467 rules applied. Total rules applied 914 place count 2200 transition count 2579
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 935 place count 2179 transition count 2579
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 314 Pre rules applied. Total rules applied 935 place count 2179 transition count 2265
Deduced a syphon composed of 314 places in 2 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1563 place count 1865 transition count 2265
Discarding 974 places :
Symmetric choice reduction at 3 with 974 rule applications. Total rules 2537 place count 891 transition count 1291
Iterating global reduction 3 with 974 rules applied. Total rules applied 3511 place count 891 transition count 1291
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 3511 place count 891 transition count 1285
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 3523 place count 885 transition count 1285
Discarding 133 places :
Symmetric choice reduction at 3 with 133 rule applications. Total rules 3656 place count 752 transition count 1152
Iterating global reduction 3 with 133 rules applied. Total rules applied 3789 place count 752 transition count 1152
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 3 with 115 rules applied. Total rules applied 3904 place count 752 transition count 1037
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 4078 place count 665 transition count 950
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 4092 place count 658 transition count 950
Free-agglomeration rule applied 103 times.
Iterating global reduction 4 with 103 rules applied. Total rules applied 4195 place count 658 transition count 847
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 4 with 103 rules applied. Total rules applied 4298 place count 555 transition count 847
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4299 place count 554 transition count 846
Iterating global reduction 5 with 1 rules applied. Total rules applied 4300 place count 554 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4301 place count 554 transition count 845
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 4312 place count 554 transition count 834
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 4322 place count 554 transition count 834
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 4324 place count 554 transition count 834
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4325 place count 553 transition count 833
Applied a total of 4325 rules in 795 ms. Remains 553 /2678 variables (removed 2125) and now considering 833/3085 (removed 2252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 812 ms. Remains : 553/2678 places, 833/3085 transitions.
RANDOM walk for 40000 steps (915 resets) in 776 ms. (51 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (56 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (56 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (33 resets) in 102 ms. (388 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (57 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (55 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (56 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (57 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
[2024-05-22 23:52:21] [INFO ] Flow matrix only has 818 transitions (discarded 15 similar events)
// Phase 1: matrix 818 rows 553 cols
[2024-05-22 23:52:21] [INFO ] Computed 16 invariants in 10 ms
[2024-05-22 23:52:21] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 464/545 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/553 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 818/1371 variables, 553/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1371 variables, 102/671 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1371 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1371 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1371/1371 variables, and 671 constraints, problems are : Problem set: 0 solved, 6 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 553/553 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 464/545 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:22] [INFO ] Deduced a trap composed of 233 places in 175 ms of which 4 ms to minimize.
[2024-05-22 23:52:22] [INFO ] Deduced a trap composed of 218 places in 196 ms of which 4 ms to minimize.
[2024-05-22 23:52:22] [INFO ] Deduced a trap composed of 253 places in 172 ms of which 3 ms to minimize.
[2024-05-22 23:52:23] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-22 23:52:23] [INFO ] Deduced a trap composed of 237 places in 177 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:23] [INFO ] Deduced a trap composed of 249 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/545 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:23] [INFO ] Deduced a trap composed of 215 places in 184 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:24] [INFO ] Deduced a trap composed of 208 places in 179 ms of which 3 ms to minimize.
[2024-05-22 23:52:24] [INFO ] Deduced a trap composed of 257 places in 171 ms of which 3 ms to minimize.
[2024-05-22 23:52:24] [INFO ] Deduced a trap composed of 237 places in 164 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:24] [INFO ] Deduced a trap composed of 273 places in 189 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:24] [INFO ] Deduced a trap composed of 213 places in 171 ms of which 3 ms to minimize.
[2024-05-22 23:52:25] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:25] [INFO ] Deduced a trap composed of 234 places in 165 ms of which 3 ms to minimize.
[2024-05-22 23:52:25] [INFO ] Deduced a trap composed of 257 places in 169 ms of which 3 ms to minimize.
[2024-05-22 23:52:25] [INFO ] Deduced a trap composed of 256 places in 152 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 8/553 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:26] [INFO ] Deduced a trap composed of 244 places in 178 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 818/1371 variables, 553/586 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1371 variables, 102/688 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1371 variables, 6/694 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:26] [INFO ] Deduced a trap composed of 257 places in 169 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1371 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:27] [INFO ] Deduced a trap composed of 235 places in 166 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1371 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1371 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:28] [INFO ] Deduced a trap composed of 236 places in 158 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/1371 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1371 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:29] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 3 ms to minimize.
[2024-05-22 23:52:30] [INFO ] Deduced a trap composed of 247 places in 164 ms of which 3 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/1371 variables, 2/699 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:52:30] [INFO ] Deduced a trap composed of 229 places in 178 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1371 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1371 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1371 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1371/1371 variables, and 700 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9735 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 553/553 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 23/23 constraints]
After SMT, in 10537ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 1164 ms.
Support contains 35 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 833/833 transitions.
Graph (trivial) has 158 edges and 553 vertex of which 8 / 553 are part of one of the 3 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 548 transition count 808
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 531 transition count 807
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 530 transition count 807
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 37 place count 530 transition count 801
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 49 place count 524 transition count 801
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 94 place count 479 transition count 756
Iterating global reduction 3 with 45 rules applied. Total rules applied 139 place count 479 transition count 756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 141 place count 479 transition count 754
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 143 place count 477 transition count 752
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 477 transition count 752
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 477 transition count 750
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 193 place count 454 transition count 727
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 195 place count 454 transition count 725
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 217 place count 432 transition count 703
Iterating global reduction 6 with 22 rules applied. Total rules applied 239 place count 432 transition count 703
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 261 place count 432 transition count 681
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 264 place count 432 transition count 678
Free-agglomeration rule applied 52 times.
Iterating global reduction 7 with 52 rules applied. Total rules applied 316 place count 432 transition count 626
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 56 rules applied. Total rules applied 372 place count 380 transition count 622
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 390 place count 362 transition count 604
Iterating global reduction 8 with 18 rules applied. Total rules applied 408 place count 362 transition count 604
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 426 place count 362 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 430 place count 362 transition count 582
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 431 place count 362 transition count 582
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 432 place count 361 transition count 581
Applied a total of 432 rules in 179 ms. Remains 361 /553 variables (removed 192) and now considering 581/833 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 361/553 places, 581/833 transitions.
RANDOM walk for 40000 steps (345 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (41 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (43 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 662143 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 2
Probabilistic random walk after 662143 steps, saw 161197 distinct states, run finished after 3005 ms. (steps per millisecond=220 ) properties seen :0
[2024-05-22 23:52:36] [INFO ] Flow matrix only has 561 transitions (discarded 20 similar events)
// Phase 1: matrix 561 rows 361 cols
[2024-05-22 23:52:36] [INFO ] Computed 16 invariants in 7 ms
[2024-05-22 23:52:36] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 314/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 561/910 variables, 349/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/910 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/910 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 12/922 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/922 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 922/922 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 314/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 23:52:36] [INFO ] Deduced a trap composed of 171 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 561/910 variables, 349/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/910 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/910 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 23:52:37] [INFO ] Deduced a trap composed of 172 places in 107 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/910 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/910 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/922 variables, 12/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/922 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/922 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/922 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 922/922 variables, and 382 constraints, problems are : Problem set: 0 solved, 2 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1150ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 203 ms.
Support contains 35 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 581/581 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 581/581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 361/361 places, 581/581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 581/581 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 581/581 (removed 0) transitions.
[2024-05-22 23:52:37] [INFO ] Flow matrix only has 561 transitions (discarded 20 similar events)
[2024-05-22 23:52:37] [INFO ] Invariant cache hit.
[2024-05-22 23:52:37] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 23:52:37] [INFO ] Flow matrix only has 561 transitions (discarded 20 similar events)
[2024-05-22 23:52:37] [INFO ] Invariant cache hit.
[2024-05-22 23:52:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:52:38] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-05-22 23:52:38] [INFO ] Redundant transitions in 32 ms returned []
Running 574 sub problems to find dead transitions.
[2024-05-22 23:52:38] [INFO ] Flow matrix only has 561 transitions (discarded 20 similar events)
[2024-05-22 23:52:38] [INFO ] Invariant cache hit.
[2024-05-22 23:52:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 2/361 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-22 23:52:46] [INFO ] Deduced a trap composed of 182 places in 139 ms of which 2 ms to minimize.
[2024-05-22 23:52:48] [INFO ] Deduced a trap composed of 172 places in 115 ms of which 2 ms to minimize.
[2024-05-22 23:52:48] [INFO ] Deduced a trap composed of 171 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (OVERLAPS) 561/922 variables, 361/380 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/922 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 922/922 variables, and 381 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 2/361 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (OVERLAPS) 561/922 variables, 361/380 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/922 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 574/955 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-22 23:53:22] [INFO ] Deduced a trap composed of 183 places in 122 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 1/956 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 922/922 variables, and 956 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 4/4 constraints]
After SMT, in 60826ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60833ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61401 ms. Remains : 361/361 places, 581/581 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 361 transition count 524
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 129 place count 324 transition count 489
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 178 place count 275 transition count 440
Iterating global reduction 2 with 49 rules applied. Total rules applied 227 place count 275 transition count 440
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 265 place count 275 transition count 402
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 267 place count 274 transition count 401
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 273 transition count 400
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 273 transition count 400
Applied a total of 269 rules in 22 ms. Remains 273 /361 variables (removed 88) and now considering 400/581 (removed 181) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 400 rows 273 cols
[2024-05-22 23:53:39] [INFO ] Computed 16 invariants in 2 ms
[2024-05-22 23:53:39] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2024-05-22 23:53:39] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:53:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-22 23:53:39] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 23:53:39] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 7 ms to minimize.
[2024-05-22 23:53:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
TRAPS : Iteration 1
[2024-05-22 23:53:40] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 23:53:40] [INFO ] After 817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1018 ms.
[2024-05-22 23:53:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-22 23:53:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 361 places, 581 transitions and 2070 arcs took 9 ms.
[2024-05-22 23:53:40] [INFO ] Flatten gal took : 116 ms
Total runtime 92278 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-14b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 361
TRANSITIONS: 581
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.004s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 694
MODEL NAME: /home/mcc/execution/412/model
361 places, 581 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-00 CANNOT_COMPUTE
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-2024-05 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716422884691

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="FlexibleBarrier-PT-14b"
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 FlexibleBarrier-PT-14b, 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 r179-tall-171640600800095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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