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.r399-tall-171690531300863.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 Szymanski-PT-b02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531300863
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K 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 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b02-ReachabilityFireability-2024-00
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-01
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-02
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-03
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-04
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-05
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-06
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-07
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-08
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-09
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-10
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-11
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-12
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-13
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-14
FORMULA_NAME Szymanski-PT-b02-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717095528201

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 18:58:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 18:58:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 18:58:49] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2024-05-30 18:58:49] [INFO ] Transformed 568 places.
[2024-05-30 18:58:49] [INFO ] Transformed 8320 transitions.
[2024-05-30 18:58:49] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
RANDOM walk for 40001 steps (8 resets) in 2160 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 186 ms. (21 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 288 ms. (13 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 117604 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :1 out of 16
Probabilistic random walk after 117604 steps, saw 42180 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :1
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-30 18:58:54] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-30 18:58:54] [INFO ] Computed 3 invariants in 38 ms
[2024-05-30 18:58:54] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem Szymanski-PT-b02-ReachabilityFireability-2024-00 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b02-ReachabilityFireability-2024-01 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b02-ReachabilityFireability-2024-03 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b02-ReachabilityFireability-2024-06 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b02-ReachabilityFireability-2024-07 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b02-ReachabilityFireability-2024-09 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b02-ReachabilityFireability-2024-11 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b02-ReachabilityFireability-2024-14 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 155/307 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 7 unsolved
[2024-05-30 18:58:55] [INFO ] Deduced a trap composed of 43 places in 625 ms of which 39 ms to minimize.
[2024-05-30 18:58:56] [INFO ] Deduced a trap composed of 76 places in 279 ms of which 2 ms to minimize.
[2024-05-30 18:58:56] [INFO ] Deduced a trap composed of 102 places in 494 ms of which 2 ms to minimize.
[2024-05-30 18:58:57] [INFO ] Deduced a trap composed of 139 places in 459 ms of which 2 ms to minimize.
[2024-05-30 18:58:57] [INFO ] Deduced a trap composed of 43 places in 475 ms of which 3 ms to minimize.
[2024-05-30 18:58:58] [INFO ] Deduced a trap composed of 43 places in 445 ms of which 2 ms to minimize.
[2024-05-30 18:58:58] [INFO ] Deduced a trap composed of 63 places in 549 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 7/9 constraints. Problems are: Problem set: 8 solved, 7 unsolved
[2024-05-30 18:58:59] [INFO ] Deduced a trap composed of 99 places in 541 ms of which 2 ms to minimize.
[2024-05-30 18:58:59] [INFO ] Deduced a trap composed of 122 places in 502 ms of which 3 ms to minimize.
SMT process timed out in 5883ms, After SMT, problems are : Problem set: 8 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 372 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 306/308 places, 8064/8064 transitions.
RANDOM walk for 40000 steps (9 resets) in 330 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 205 ms. (194 steps per ms) remains 6/7 properties
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-30 18:59:00] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-30 18:59:00] [INFO ] Computed 1 invariants in 33 ms
[2024-05-30 18:59:00] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 240/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3039/3039 variables, and 454 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12398 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 240/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3039/3039 variables, and 454 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45014 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 57584ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 261 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 305/306 places, 7936/8064 transitions.
RANDOM walk for 40001 steps (9 resets) in 370 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 128965 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 6
Probabilistic random walk after 128965 steps, saw 45911 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-30 19:00:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 19:00:02] [INFO ] Computed 1 invariants in 34 ms
[2024-05-30 19:00:02] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 239/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9491 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 239/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75022 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 84698ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 287 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 305/305 places, 7936/7936 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 19:01:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 19:01:27] [INFO ] Invariant cache hit.
[2024-05-30 19:01:27] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-30 19:01:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 19:01:27] [INFO ] Invariant cache hit.
[2024-05-30 19:01:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 19:01:51] [INFO ] Implicit Places using invariants and state equation in 24132 ms returned []
Implicit Place search using SMT with State Equation took 24472 ms to find 0 implicit places.
[2024-05-30 19:01:52] [INFO ] Redundant transitions in 882 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-05-30 19:01:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 19:01:52] [INFO ] Invariant cache hit.
[2024-05-30 19:01:52] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30160 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30097 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 88269ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 88343ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113922 ms. Remains : 305/305 places, 7936/7936 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1168 edges and 305 vertex of which 4 / 305 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 448 transitions
Ensure Unique test removed 4760 transitions
Reduce isomorphic transitions removed 5208 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 303 transition count 2726
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 301 transition count 2726
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 300 transition count 2725
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 300 transition count 2722
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 300 transition count 2720
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 298 transition count 2720
Applied a total of 14 rules in 210 ms. Remains 298 /305 variables (removed 7) and now considering 2720/7936 (removed 5216) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2720 rows 298 cols
[2024-05-30 19:03:21] [INFO ] Computed 1 invariants in 42 ms
[2024-05-30 19:03:21] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-30 19:03:21] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-30 19:03:21] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-30 19:03:22] [INFO ] After 891ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :6
[2024-05-30 19:03:22] [INFO ] After 987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 1425 ms.
[2024-05-30 19:03:22] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-30 19:03:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7936 transitions and 31616 arcs took 29 ms.
[2024-05-30 19:03:23] [INFO ] Flatten gal took : 450 ms
Total runtime 273777 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Szymanski-PT-b02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 305
TRANSITIONS: 7936
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.151s, Sys 0.012s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.016s, Sys 0.008s]


----------------------------------------------------------------------
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: 615
MODEL NAME: /home/mcc/execution/409/model
305 places, 7936 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 Szymanski-PT-b02-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-04 CANNOT_COMPUTE
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-08 CANNOT_COMPUTE
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-10 CANNOT_COMPUTE
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-12 CANNOT_COMPUTE
FORMULA Szymanski-PT-b02-ReachabilityFireability-2024-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717097260948

--------------------
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

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="Szymanski-PT-b02"
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 Szymanski-PT-b02, 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 r399-tall-171690531300863"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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