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.r201-smll-171649586600118.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 HirschbergSinclair-PT-40, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586600118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 13 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 580K 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 HirschbergSinclair-PT-40-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716627704396

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 09:01:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 09:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:01:47] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2024-05-25 09:01:47] [INFO ] Transformed 1068 places.
[2024-05-25 09:01:47] [INFO ] Transformed 982 transitions.
[2024-05-25 09:01:47] [INFO ] Parsed PT model containing 1068 places and 982 transitions and 2991 arcs in 639 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 66 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (40 resets) in 3082 ms. (12 steps per ms) remains 7/16 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 308 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
// Phase 1: matrix 982 rows 1068 cols
[2024-05-25 09:01:49] [INFO ] Computed 86 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-03 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 748/922 variables, 59/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/922 variables, 1/60 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/922 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 63/985 variables, 21/81 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 54/1039 variables, 5/86 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1039 variables, 0/86 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 982/2021 variables, 1039/1125 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2021 variables, 0/1125 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 29/2050 variables, 29/1154 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2050 variables, 0/1154 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2050 variables, 0/1154 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2050/2050 variables, and 1154 constraints, problems are : Problem set: 3 solved, 4 unsolved in 4230 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1068/1068 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-00 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 751/921 variables, 59/59 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/921 variables, 1/60 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 09:01:55] [INFO ] Deduced a trap composed of 19 places in 537 ms of which 70 ms to minimize.
[2024-05-25 09:01:55] [INFO ] Deduced a trap composed of 60 places in 397 ms of which 8 ms to minimize.
[2024-05-25 09:01:55] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 9 ms to minimize.
[2024-05-25 09:01:56] [INFO ] Deduced a trap composed of 97 places in 305 ms of which 7 ms to minimize.
[2024-05-25 09:01:56] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/921 variables, 5/65 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 09:01:57] [INFO ] Deduced a trap composed of 18 places in 336 ms of which 7 ms to minimize.
[2024-05-25 09:01:57] [INFO ] Deduced a trap composed of 104 places in 324 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 2/67 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 09:01:57] [INFO ] Deduced a trap composed of 103 places in 263 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/921 variables, 1/68 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 0/68 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 63/984 variables, 21/89 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 09:01:58] [INFO ] Deduced a trap composed of 15 places in 450 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/984 variables, 1/90 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/2050 variables, and 90 constraints, problems are : Problem set: 4 solved, 3 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 1/6 constraints, State Equation: 0/1068 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 9526ms problems are : Problem set: 4 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 1068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1068/1068 places, 982/982 transitions.
Graph (complete) has 2054 edges and 1068 vertex of which 1034 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.6 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 1034 transition count 703
Reduce places removed 279 places and 0 transitions.
Graph (complete) has 1335 edges and 755 vertex of which 687 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.2 ms
Discarding 68 places :
Also discarding 0 output transitions
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 310 rules applied. Total rules applied 590 place count 687 transition count 673
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 98 rules applied. Total rules applied 688 place count 657 transition count 605
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 694 place count 651 transition count 599
Iterating global reduction 3 with 6 rules applied. Total rules applied 700 place count 651 transition count 599
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 705 place count 646 transition count 594
Iterating global reduction 3 with 5 rules applied. Total rules applied 710 place count 646 transition count 594
Free-agglomeration rule (complex) applied 53 times.
Iterating global reduction 3 with 53 rules applied. Total rules applied 763 place count 646 transition count 541
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 816 place count 593 transition count 541
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 4 with 23 rules applied. Total rules applied 839 place count 570 transition count 518
Applied a total of 839 rules in 408 ms. Remains 570 /1068 variables (removed 498) and now considering 518/982 (removed 464) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 570/1068 places, 518/982 transitions.
RANDOM walk for 40000 steps (74 resets) in 1099 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 252 ms. (158 steps per ms) remains 2/3 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 210 ms. (189 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 518 rows 570 cols
[2024-05-25 09:01:59] [INFO ] Computed 52 invariants in 3 ms
[2024-05-25 09:01:59] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 423/472 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/475 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/538 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 506/1044 variables, 538/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1044 variables, 94/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1044 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/1080 variables, 27/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1083 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1083 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1083 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1083/1088 variables, and 714 constraints, problems are : Problem set: 0 solved, 1 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 46/47 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 567/570 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 423/472 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 09:02:01] [INFO ] Deduced a trap composed of 10 places in 366 ms of which 6 ms to minimize.
[2024-05-25 09:02:01] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 09:02:02] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/475 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 09:02:02] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/538 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 09:02:02] [INFO ] Deduced a trap composed of 42 places in 360 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 09:02:03] [INFO ] Deduced a trap composed of 69 places in 351 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 506/1044 variables, 538/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1044 variables, 94/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 09:02:03] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1044 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1044 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 36/1080 variables, 27/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1080 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1080 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 09:02:04] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 5 ms to minimize.
[2024-05-25 09:02:05] [INFO ] Deduced a trap composed of 85 places in 310 ms of which 8 ms to minimize.
[2024-05-25 09:02:05] [INFO ] Deduced a trap composed of 75 places in 276 ms of which 5 ms to minimize.
[2024-05-25 09:02:05] [INFO ] Deduced a trap composed of 120 places in 219 ms of which 5 ms to minimize.
[2024-05-25 09:02:06] [INFO ] Deduced a trap composed of 127 places in 190 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1080 variables, 5/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1080 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/1083 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1083 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1083 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1083 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1083/1088 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5738 ms.
Refiners :[Positive P Invariants (semi-flows): 46/47 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 567/570 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 6633ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 252 ms.
Support contains 49 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 518/518 transitions.
Graph (complete) has 1036 edges and 570 vertex of which 557 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 557 transition count 462
Reduce places removed 46 places and 0 transitions.
Graph (complete) has 919 edges and 511 vertex of which 503 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 106 place count 503 transition count 460
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 116 place count 501 transition count 452
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 498 transition count 449
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 498 transition count 449
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 498 transition count 448
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 904 edges and 497 vertex of which 495 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 495 transition count 448
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 495 transition count 446
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 128 place count 494 transition count 445
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 494 transition count 445
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 139 place count 494 transition count 435
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 149 place count 484 transition count 435
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 161 place count 472 transition count 423
Applied a total of 161 rules in 174 ms. Remains 472 /570 variables (removed 98) and now considering 423/518 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 472/570 places, 423/518 transitions.
RANDOM walk for 40000 steps (92 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 397318 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 397318 steps, saw 99707 distinct states, run finished after 3007 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 423 rows 472 cols
[2024-05-25 09:02:10] [INFO ] Computed 49 invariants in 4 ms
[2024-05-25 09:02:10] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 403/460 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/881 variables, 460/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/881 variables, 12/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/881 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/895 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/895 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/895 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 895/895 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 472/472 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 403/460 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/881 variables, 460/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/881 variables, 12/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/881 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/895 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/895 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/895 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/895 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 895/895 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 472/472 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2858ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 136 ms.
Support contains 49 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 423/423 transitions.
Applied a total of 0 rules in 44 ms. Remains 472 /472 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 472/472 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 423/423 transitions.
Applied a total of 0 rules in 37 ms. Remains 472 /472 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2024-05-25 09:02:13] [INFO ] Invariant cache hit.
[2024-05-25 09:02:14] [INFO ] Implicit Places using invariants in 831 ms returned []
[2024-05-25 09:02:14] [INFO ] Invariant cache hit.
[2024-05-25 09:02:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 09:02:17] [INFO ] Implicit Places using invariants and state equation in 3482 ms returned []
Implicit Place search using SMT with State Equation took 4335 ms to find 0 implicit places.
[2024-05-25 09:02:17] [INFO ] Redundant transitions in 26 ms returned []
Running 406 sub problems to find dead transitions.
[2024-05-25 09:02:17] [INFO ] Invariant cache hit.
[2024-05-25 09:02:17] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 6/458 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 7/465 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 394.0)
(s1 393.0)
(s2 1.0)
(s3 394.0)
(s4 394.0)
(s5 0.0)
(s6 1.0)
(s7 393.0)
(s8 393.0)
(s9 393.0)
(s10 392.0)
(s11 392.0)
(s12 391.0)
(s13 390.0)
(s14 388.0)
(s15 388.0)
(s16 388.0)
(s17 0.0)
(s18 388.0)
(s19 389.0)
(s20 389.0)
(s21 389.0)
(s22 389.0)
(s23 380.0)
(s24 1.0)
(s25 387.0)
(s26 386.0)
(s27 386.0)
(s28 387.0)
(s29 386.0)
(s30 387.0)
(s31 385.0)
(s32 386.0)
(s33 0.0)
(s34 386.0)
(s35 387.0)
(s36 387.0)
(s37 386.0)
(s38 387.0)
(s39 387.0)
(s40 0.0)
(s41 375.0)
(s42 384.0)
(s43 385.0)
(s44 0.0)
(s46 1.0)
(s47 1.0)
(s49 392.0)
(s50 1.0)
(s51 382.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s72 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 2.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(timeout
s139 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 406 unsolved
SMT process timed out in 30136ms, After SMT, problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 30144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34557 ms. Remains : 472/472 places, 423/423 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 460 transition count 197
Reduce places removed 226 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 231 rules applied. Total rules applied 469 place count 234 transition count 192
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 474 place count 229 transition count 192
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 474 place count 229 transition count 144
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 570 place count 181 transition count 144
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 571 place count 180 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 572 place count 179 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 573 place count 179 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 577 place count 177 transition count 141
Applied a total of 577 rules in 86 ms. Remains 177 /472 variables (removed 295) and now considering 141/423 (removed 282) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 141 rows 177 cols
[2024-05-25 09:02:47] [INFO ] Computed 36 invariants in 2 ms
[2024-05-25 09:02:48] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:02:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2024-05-25 09:02:48] [INFO ] [Nat]Absence check using 4 positive and 32 generalized place invariants in 55 ms returned sat
[2024-05-25 09:02:48] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 09:02:48] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:02:48] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 821 ms.
[2024-05-25 09:02:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2024-05-25 09:02:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 472 places, 423 transitions and 1595 arcs took 27 ms.
[2024-05-25 09:02:49] [INFO ] Flatten gal took : 164 ms
Total runtime 62678 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HirschbergSinclair-PT-40

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 472
TRANSITIONS: 423
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.005s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 642
MODEL NAME: /home/mcc/execution/406/model
472 places, 423 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.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
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.
Creating all event NSFs..
Creating all event NSFs..

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -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="HirschbergSinclair-PT-40"
export BK_EXAMINATION="ReachabilityCardinality"
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 HirschbergSinclair-PT-40, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-171649586600118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-40.tgz
mv HirschbergSinclair-PT-40 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;