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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 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 141K 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-06b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716416608102

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-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:23:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 22:23:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:23:29] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-22 22:23:29] [INFO ] Transformed 542 places.
[2024-05-22 22:23:29] [INFO ] Transformed 621 transitions.
[2024-05-22 22:23:29] [INFO ] Found NUPN structural information;
[2024-05-22 22:23:29] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (775 resets) in 1961 ms. (20 steps per ms) remains 9/16 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (109 resets) in 188 ms. (211 steps per ms) remains 8/9 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (103 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (91 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (104 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (111 resets) in 880 ms. (45 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (112 resets) in 467 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (31 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
// Phase 1: matrix 621 rows 542 cols
[2024-05-22 22:23:31] [INFO ] Computed 8 invariants in 30 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, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem FlexibleBarrier-PT-06b-ReachabilityFireability-2024-00 is UNSAT
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FlexibleBarrier-PT-06b-ReachabilityFireability-2024-06 is UNSAT
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 407/542 variables, 8/143 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 407/550 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 0/550 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 621/1163 variables, 542/1092 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 1092 constraints, problems are : Problem set: 2 solved, 5 unsolved in 934 ms.
Refiners :[Domain max(s): 542/542 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
Problem FlexibleBarrier-PT-06b-ReachabilityFireability-2024-13 is UNSAT
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 435/542 variables, 8/115 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 435/550 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 22:23:32] [INFO ] Deduced a trap composed of 144 places in 215 ms of which 35 ms to minimize.
[2024-05-22 22:23:32] [INFO ] Deduced a trap composed of 93 places in 195 ms of which 4 ms to minimize.
[2024-05-22 22:23:32] [INFO ] Deduced a trap composed of 98 places in 186 ms of which 3 ms to minimize.
[2024-05-22 22:23:33] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 11 ms to minimize.
[2024-05-22 22:23:33] [INFO ] Deduced a trap composed of 193 places in 185 ms of which 4 ms to minimize.
[2024-05-22 22:23:33] [INFO ] Deduced a trap composed of 191 places in 153 ms of which 3 ms to minimize.
[2024-05-22 22:23:33] [INFO ] Deduced a trap composed of 187 places in 127 ms of which 2 ms to minimize.
[2024-05-22 22:23:33] [INFO ] Deduced a trap composed of 159 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 8/558 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 22:23:34] [INFO ] Deduced a trap composed of 160 places in 128 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 1/559 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/559 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 621/1163 variables, 542/1101 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1163 variables, 4/1105 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1163 variables, 0/1105 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1163 variables, 0/1105 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1105 constraints, problems are : Problem set: 3 solved, 4 unsolved in 3469 ms.
Refiners :[Domain max(s): 542/542 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 4589ms problems are : Problem set: 3 solved, 4 unsolved
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 982 ms.
Support contains 95 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 542 transition count 556
Reduce places removed 65 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 87 rules applied. Total rules applied 152 place count 477 transition count 534
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 174 place count 455 transition count 534
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 174 place count 455 transition count 479
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 284 place count 400 transition count 479
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 409 place count 275 transition count 354
Iterating global reduction 3 with 125 rules applied. Total rules applied 534 place count 275 transition count 354
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 542 place count 267 transition count 346
Iterating global reduction 3 with 8 rules applied. Total rules applied 550 place count 267 transition count 346
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 554 place count 267 transition count 342
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 624 place count 232 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 628 place count 230 transition count 307
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 636 place count 230 transition count 299
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 644 place count 222 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 646 place count 222 transition count 297
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 649 place count 222 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 650 place count 221 transition count 296
Applied a total of 650 rules in 152 ms. Remains 221 /542 variables (removed 321) and now considering 296/621 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 221/542 places, 296/621 transitions.
RANDOM walk for 40000 steps (1391 resets) in 450 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (133 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (197 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (200 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 696432 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 3
Probabilistic random walk after 696432 steps, saw 185355 distinct states, run finished after 3011 ms. (steps per millisecond=231 ) properties seen :0
[2024-05-22 22:23:40] [INFO ] Flow matrix only has 294 transitions (discarded 2 similar events)
// Phase 1: matrix 294 rows 221 cols
[2024-05-22 22:23:40] [INFO ] Computed 8 invariants in 7 ms
[2024-05-22 22:23:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 126/221 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 294/515 variables, 221/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/515 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 230 constraints, problems are : Problem set: 0 solved, 3 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 126/221 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 22:23:40] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 22:23:40] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:23:40] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 3 ms to minimize.
[2024-05-22 22:23:40] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-05-22 22:23:40] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:23:40] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:23:40] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 22:23:41] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:23:41] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 22:23:41] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 294/515 variables, 221/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/515 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 243 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 1749ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 730 ms.
Support contains 95 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 296/296 transitions.
Applied a total of 0 rules in 8 ms. Remains 221 /221 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 221/221 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 296/296 transitions.
Applied a total of 0 rules in 7 ms. Remains 221 /221 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 22:23:42] [INFO ] Flow matrix only has 294 transitions (discarded 2 similar events)
[2024-05-22 22:23:42] [INFO ] Invariant cache hit.
[2024-05-22 22:23:42] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 22:23:42] [INFO ] Flow matrix only has 294 transitions (discarded 2 similar events)
[2024-05-22 22:23:42] [INFO ] Invariant cache hit.
[2024-05-22 22:23:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:23:42] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-22 22:23:42] [INFO ] Redundant transitions in 15 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 22:23:42] [INFO ] Flow matrix only has 294 transitions (discarded 2 similar events)
[2024-05-22 22:23:42] [INFO ] Invariant cache hit.
[2024-05-22 22:23:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 3/221 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:23:45] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 22:23:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-22 22:23:45] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-22 22:23:46] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 2 ms to minimize.
[2024-05-22 22:23:46] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-05-22 22:23:46] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 1 ms to minimize.
[2024-05-22 22:23:46] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/515 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 0/515 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 237 constraints, problems are : Problem set: 0 solved, 293 unsolved in 12128 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 3/221 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/515 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 293/530 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:23:58] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-22 22:23:59] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2024-05-22 22:24:00] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
[2024-05-22 22:24:01] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 4/534 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:24:06] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (OVERLAPS) 0/515 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 535 constraints, problems are : Problem set: 0 solved, 293 unsolved in 25027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 12/12 constraints]
After SMT, in 37261ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 37280ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37582 ms. Remains : 221/221 places, 296/296 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 218 transition count 291
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 218 transition count 291
Applied a total of 8 rules in 13 ms. Remains 218 /221 variables (removed 3) and now considering 291/296 (removed 5) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 291 rows 218 cols
[2024-05-22 22:24:20] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:24:20] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 22:24:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 22:24:20] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 22:24:21] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-22 22:24:21] [INFO ] Deduced a trap composed of 64 places in 467 ms of which 2 ms to minimize.
[2024-05-22 22:24:21] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 2 ms to minimize.
[2024-05-22 22:24:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
TRAPS : Iteration 1
[2024-05-22 22:24:22] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 8 ms to minimize.
[2024-05-22 22:24:22] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:24:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2024-05-22 22:24:22] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:24:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
TRAPS : Iteration 2
[2024-05-22 22:24:22] [INFO ] After 1972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 22:24:22] [INFO ] After 2290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 2473 ms.
[2024-05-22 22:24:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2024-05-22 22:24:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 221 places, 296 transitions and 887 arcs took 4 ms.
[2024-05-22 22:24:22] [INFO ] Flatten gal took : 116 ms
Total runtime 53630 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-06b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 221
TRANSITIONS: 296
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 690
MODEL NAME: /home/mcc/execution/413/model
221 places, 296 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-06b-ReachabilityFireability-2024-03 CANNOT_COMPUTE
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-09 CANNOT_COMPUTE
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716417181253

--------------------
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
MEDDLY ERROR: Insufficient memory

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-06b"
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-06b, 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-171640600600031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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