Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m256-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m256-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716301196191

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:19:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:19:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:19:58] [INFO ] Load time of PNML (sax parser for PT used): 992 ms
[2024-05-21 14:19:58] [INFO ] Transformed 754 places.
[2024-05-21 14:19:59] [INFO ] Transformed 27370 transitions.
[2024-05-21 14:19:59] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 474 places in 132 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m256-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 278 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 278 transition count 3871
Applied a total of 3 rules in 96 ms. Remains 278 /280 variables (removed 2) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 14:19:59] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 278 cols
[2024-05-21 14:19:59] [INFO ] Computed 9 invariants in 85 ms
[2024-05-21 14:20:00] [INFO ] Implicit Places using invariants in 854 ms returned []
[2024-05-21 14:20:00] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 14:20:00] [INFO ] Invariant cache hit.
[2024-05-21 14:20:01] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 14:20:02] [INFO ] Implicit Places using invariants and state equation in 2208 ms returned []
Implicit Place search using SMT with State Equation took 3104 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 14:20:02] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 14:20:02] [INFO ] Invariant cache hit.
[2024-05-21 14:20:02] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-05-21 14:21:05] [INFO ] Deduced a trap composed of 10 places in 476 ms of which 13 ms to minimize.
[2024-05-21 14:21:05] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 2 ms to minimize.
[2024-05-21 14:21:05] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 1 ms to minimize.
[2024-05-21 14:21:15] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3985 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/278 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3985 variables, and 12 constraints, problems are : Problem set: 45 solved, 3824 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/278 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 4/4 constraints]
After SMT, in 105424ms problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 45 dead transitions in 105494ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3826/3904 transitions.
Reduce places removed 11 places and 334 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 267 transition count 3492
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 262 transition count 3340
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 260 transition count 3284
Reduce places removed 0 places and 32 transitions.
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 259 transition count 3227
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 259 transition count 3227
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 20 rules in 91 ms. Remains 259 /278 variables (removed 19) and now considering 3227/3826 (removed 599) transitions.
[2024-05-21 14:21:48] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
// Phase 1: matrix 3100 rows 259 cols
[2024-05-21 14:21:48] [INFO ] Computed 10 invariants in 42 ms
[2024-05-21 14:21:48] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-05-21 14:21:48] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-05-21 14:21:48] [INFO ] Invariant cache hit.
[2024-05-21 14:21:49] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 14:21:50] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 2302 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 259/280 places, 3227/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111133 ms. Remains : 259/280 places, 3227/3904 transitions.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Support contains 25 out of 258 places after structural reductions.
[2024-05-21 14:21:51] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 14:21:51] [INFO ] Flatten gal took : 380 ms
FORMULA BugTracking-PT-q8m256-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:21:51] [INFO ] Flatten gal took : 210 ms
[2024-05-21 14:21:51] [INFO ] Input system was already deterministic with 3227 transitions.
Support contains 23 out of 258 places (down from 25) after GAL structural reductions.
FORMULA BugTracking-PT-q8m256-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40190 steps (9 resets) in 1543 ms. (26 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 108500 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 19
Probabilistic random walk after 108500 steps, saw 52058 distinct states, run finished after 3018 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-21 14:21:55] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
// Phase 1: matrix 3100 rows 258 cols
[2024-05-21 14:21:55] [INFO ] Computed 9 invariants in 13 ms
[2024-05-21 14:21:55] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 110/131 variables, 5/5 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2836/2967 variables, 131/136 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2967 variables, 97/233 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2967 variables, 0/233 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 377/3344 variables, 114/347 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3344 variables, 2/349 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3344 variables, 153/502 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3344 variables, 0/502 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 4/3348 variables, 2/504 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3348 variables, 2/506 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3348 variables, 0/506 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 10/3358 variables, 11/517 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3358 variables, 1/518 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3358 variables, 0/518 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/3358 variables, 0/518 constraints. Problems are: Problem set: 7 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3358/3358 variables, and 518 constraints, problems are : Problem set: 7 solved, 12 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 258/258 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 54/67 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1531/1598 variables, 67/69 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1598 variables, 18/87 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1598 variables, 0/87 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1695/3293 variables, 130/217 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3293 variables, 3/220 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3293 variables, 230/450 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3293 variables, 12/462 constraints. Problems are: Problem set: 7 solved, 12 unsolved
[2024-05-21 14:22:00] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 1 ms to minimize.
[2024-05-21 14:22:00] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 1 ms to minimize.
[2024-05-21 14:22:00] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2024-05-21 14:22:00] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3293 variables, 4/466 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3293 variables, 0/466 constraints. Problems are: Problem set: 7 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 12 (OVERLAPS) 11/3304 variables, 4/470 constraints. Problems are: Problem set: 12 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3304 variables, 3/473 constraints. Problems are: Problem set: 12 solved, 7 unsolved
[2024-05-21 14:22:02] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2024-05-21 14:22:02] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2024-05-21 14:22:02] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 1 ms to minimize.
Problem AtomicPropp15 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/3304 variables, 3/476 constraints. Problems are: Problem set: 13 solved, 6 unsolved
[2024-05-21 14:22:03] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3304 variables, 1/477 constraints. Problems are: Problem set: 13 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3304/3358 variables, and 477 constraints, problems are : Problem set: 13 solved, 6 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 200/258 constraints, ReadFeed: 248/251 constraints, PredecessorRefiner: 12/19 constraints, Known Traps: 8/8 constraints]
After SMT, in 8154ms problems are : Problem set: 13 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 3227/3227 transitions.
Graph (complete) has 3916 edges and 258 vertex of which 257 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 255 transition count 3232
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 255 transition count 3226
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 17 place count 249 transition count 3226
Applied a total of 17 rules in 267 ms. Remains 249 /258 variables (removed 9) and now considering 3226/3227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 249/258 places, 3226/3227 transitions.
RANDOM walk for 40517 steps (8 resets) in 82 ms. (488 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1195 ms. (33 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
[2024-05-21 14:22:04] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
// Phase 1: matrix 3092 rows 249 cols
[2024-05-21 14:22:04] [INFO ] Computed 8 invariants in 13 ms
[2024-05-21 14:22:04] [INFO ] State equation strengthened by 252 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1467/1529 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1529 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1529 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1720/3249 variables, 97/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3249 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3249 variables, 239/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3249 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/3255 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3255 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3255 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 86/3341 variables, 87/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3341 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3341 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1467/1529 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1529 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1529 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1720/3249 variables, 97/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3249 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3249 variables, 239/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3249 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3249 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/3255 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3255 variables, 3/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 14:22:07] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 1 ms to minimize.
[2024-05-21 14:22:08] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3255 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 14:22:08] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3255 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3255 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 86/3341 variables, 87/512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3341 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 14:22:10] [INFO ] Deduced a trap composed of 29 places in 551 ms of which 4 ms to minimize.
[2024-05-21 14:22:10] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 2 ms to minimize.
[2024-05-21 14:22:11] [INFO ] Deduced a trap composed of 102 places in 465 ms of which 3 ms to minimize.
[2024-05-21 14:22:11] [INFO ] Deduced a trap composed of 28 places in 448 ms of which 2 ms to minimize.
[2024-05-21 14:22:12] [INFO ] Deduced a trap composed of 41 places in 363 ms of which 1 ms to minimize.
[2024-05-21 14:22:12] [INFO ] Deduced a trap composed of 41 places in 345 ms of which 2 ms to minimize.
[2024-05-21 14:22:12] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 2 ms to minimize.
[2024-05-21 14:22:13] [INFO ] Deduced a trap composed of 41 places in 382 ms of which 1 ms to minimize.
[2024-05-21 14:22:13] [INFO ] Deduced a trap composed of 8 places in 398 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3341 variables, 9/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3341 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/3341 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 526 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8958 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 12/12 constraints]
After SMT, in 10694ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 35567 ms.
Support contains 8 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 78 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 249/249 places, 3226/3226 transitions.
RANDOM walk for 40485 steps (8 resets) in 39 ms. (1012 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 85893 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 5
Probabilistic random walk after 85893 steps, saw 37985 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 14:22:54] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 14:22:54] [INFO ] Invariant cache hit.
[2024-05-21 14:22:54] [INFO ] State equation strengthened by 252 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1467/1529 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1529 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1529 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1720/3249 variables, 97/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3249 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3249 variables, 239/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3249 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/3255 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3255 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3255 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 86/3341 variables, 87/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3341 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3341 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2316 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1467/1529 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1529 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1529 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1720/3249 variables, 97/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3249 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3249 variables, 239/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3249 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3249 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/3255 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3255 variables, 3/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 14:22:58] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 1 ms to minimize.
[2024-05-21 14:22:58] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3255 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 14:22:58] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3255 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3255 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 86/3341 variables, 87/512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3341 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 14:23:00] [INFO ] Deduced a trap composed of 29 places in 513 ms of which 3 ms to minimize.
[2024-05-21 14:23:00] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 2 ms to minimize.
[2024-05-21 14:23:01] [INFO ] Deduced a trap composed of 102 places in 450 ms of which 2 ms to minimize.
[2024-05-21 14:23:01] [INFO ] Deduced a trap composed of 28 places in 453 ms of which 2 ms to minimize.
[2024-05-21 14:23:02] [INFO ] Deduced a trap composed of 41 places in 397 ms of which 2 ms to minimize.
[2024-05-21 14:23:02] [INFO ] Deduced a trap composed of 41 places in 393 ms of which 1 ms to minimize.
[2024-05-21 14:23:02] [INFO ] Deduced a trap composed of 17 places in 332 ms of which 2 ms to minimize.
[2024-05-21 14:23:03] [INFO ] Deduced a trap composed of 41 places in 397 ms of which 3 ms to minimize.
[2024-05-21 14:23:03] [INFO ] Deduced a trap composed of 8 places in 346 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3341 variables, 9/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3341 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/3341 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 526 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9105 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 12/12 constraints]
After SMT, in 11458ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 39761 ms.
Support contains 8 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 79 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 249/249 places, 3226/3226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 58 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2024-05-21 14:23:45] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 14:23:45] [INFO ] Invariant cache hit.
[2024-05-21 14:23:46] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-21 14:23:46] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 14:23:46] [INFO ] Invariant cache hit.
[2024-05-21 14:23:46] [INFO ] State equation strengthened by 252 read => feed constraints.
[2024-05-21 14:23:47] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
[2024-05-21 14:23:47] [INFO ] Redundant transitions in 220 ms returned []
Running 3225 sub problems to find dead transitions.
[2024-05-21 14:23:47] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 14:23:47] [INFO ] Invariant cache hit.
[2024-05-21 14:23:47] [INFO ] State equation strengthened by 252 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m256

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 754
TRANSITIONS: 27370
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.633s, Sys 0.076s]


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


----------------------------------------------------------------------
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: 724
MODEL NAME: /home/mcc/execution/model
754 places, 27370 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716303312792

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
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="BugTracking-PT-q8m256"
export BK_EXAMINATION="CTLCardinality"
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 BugTracking-PT-q8m256, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398200441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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