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-171620398100401.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-q8m008, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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-q8m008-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m008-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716297355505

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-q8m008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:15:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 13:15:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:15:58] [INFO ] Load time of PNML (sax parser for PT used): 993 ms
[2024-05-21 13:15:58] [INFO ] Transformed 754 places.
[2024-05-21 13:15:58] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:15:58] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1309 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Deduced a syphon composed of 474 places in 113 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m008-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Applied a total of 2 rules in 79 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2024-05-21 13:15:59] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2024-05-21 13:15:59] [INFO ] Computed 8 invariants in 88 ms
[2024-05-21 13:15:59] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-05-21 13:15:59] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 13:15:59] [INFO ] Invariant cache hit.
[2024-05-21 13:16:00] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 13:16:02] [INFO ] Implicit Places using invariants and state equation in 2831 ms returned []
Implicit Place search using SMT with State Equation took 3734 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-05-21 13:16:03] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 13:16:03] [INFO ] Invariant cache hit.
[2024-05-21 13:16:03] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/4007 variables, and 8 constraints, problems are : Problem set: 0 solved, 3902 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 3902/2705 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
[2024-05-21 13:17:18] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 28 ms to minimize.
[2024-05-21 13:17:19] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 2 ms to minimize.
[2024-05-21 13:17:21] [INFO ] Deduced a trap composed of 14 places in 2374 ms of which 27 ms to minimize.
[2024-05-21 13:17:21] [INFO ] Deduced a trap composed of 7 places in 336 ms of which 1 ms to minimize.
[2024-05-21 13:17:22] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 1 ms to minimize.
[2024-05-21 13:17:31] [INFO ] Deduced a trap composed of 11 places in 68 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 Int declared 277/4007 variables, and 14 constraints, problems are : Problem set: 14 solved, 3888 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1197/2705 constraints, Known Traps: 6/6 constraints]
After SMT, in 103971ms problems are : Problem set: 14 solved, 3888 unsolved
Search for dead transitions found 14 dead transitions in 104123ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3890/3904 transitions.
Reduce places removed 2 places and 35 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 276 transition count 3855
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 275 transition count 3830
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 275 transition count 3830
Applied a total of 4 rules in 45 ms. Remains 275 /278 variables (removed 3) and now considering 3830/3890 (removed 60) transitions.
[2024-05-21 13:17:47] [INFO ] Flow matrix only has 3662 transitions (discarded 168 similar events)
// Phase 1: matrix 3662 rows 275 cols
[2024-05-21 13:17:47] [INFO ] Computed 8 invariants in 19 ms
[2024-05-21 13:17:47] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-21 13:17:47] [INFO ] Flow matrix only has 3662 transitions (discarded 168 similar events)
[2024-05-21 13:17:47] [INFO ] Invariant cache hit.
[2024-05-21 13:17:47] [INFO ] State equation strengthened by 296 read => feed constraints.
[2024-05-21 13:17:49] [INFO ] Implicit Places using invariants and state equation in 2117 ms returned []
Implicit Place search using SMT with State Equation took 2459 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 275/280 places, 3830/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110497 ms. Remains : 275/280 places, 3830/3904 transitions.
Support contains 39 out of 275 places after structural reductions.
[2024-05-21 13:17:50] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 13:17:50] [INFO ] Flatten gal took : 399 ms
[2024-05-21 13:17:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BugTracking-PT-q8m008-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:17:50] [INFO ] Flatten gal took : 272 ms
[2024-05-21 13:17:50] [INFO ] Input system was already deterministic with 3830 transitions.
Support contains 14 out of 275 places (down from 39) after GAL structural reductions.
FORMULA BugTracking-PT-q8m008-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40006 steps (213 resets) in 3090 ms. (12 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (52 resets) in 320 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (54 resets) in 291 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (51 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (51 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (53 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (48 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (56 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (56 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (39 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (48 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 95506 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 11
Probabilistic random walk after 95506 steps, saw 54244 distinct states, run finished after 3018 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-21 13:17:55] [INFO ] Flow matrix only has 3662 transitions (discarded 168 similar events)
[2024-05-21 13:17:55] [INFO ] Invariant cache hit.
[2024-05-21 13:17:55] [INFO ] State equation strengthened by 296 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 116/130 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3343/3473 variables, 130/135 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3473 variables, 101/236 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3473 variables, 0/236 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 315/3788 variables, 117/353 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3788 variables, 1/354 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3788 variables, 172/526 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3788 variables, 0/526 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 135/3923 variables, 15/541 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3923 variables, 23/564 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3923 variables, 0/564 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3925 variables, 1/565 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3925 variables, 0/565 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 12/3937 variables, 13/578 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3937 variables, 1/579 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3937 variables, 0/579 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/3937 variables, 0/579 constraints. Problems are: Problem set: 8 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3937/3937 variables, and 579 constraints, problems are : Problem set: 8 solved, 3 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 275/275 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1124 variables, 50/52 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 1/53 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/53 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1469/2593 variables, 55/108 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2593 variables, 1/109 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2593 variables, 163/272 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2593 variables, 2/274 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2593 variables, 0/274 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1255/3848 variables, 116/390 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3848 variables, 1/391 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3848 variables, 117/508 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3848 variables, 1/509 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3848 variables, 0/509 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 8/3856 variables, 2/511 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3856 variables, 0/511 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 81/3937 variables, 54/565 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3937 variables, 2/567 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3937 variables, 15/582 constraints. Problems are: Problem set: 8 solved, 3 unsolved
[2024-05-21 13:18:01] [INFO ] Deduced a trap composed of 14 places in 385 ms of which 2 ms to minimize.
[2024-05-21 13:18:02] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3937 variables, 2/584 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3937 variables, 0/584 constraints. Problems are: Problem set: 8 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3937/3937 variables, and 584 constraints, problems are : Problem set: 8 solved, 3 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 275/275 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 3/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 7398ms problems are : Problem set: 8 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 3830/3830 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 274 transition count 3797
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 274 transition count 3797
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 6 place count 272 transition count 3803
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 272 transition count 3797
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 266 transition count 3797
Applied a total of 18 rules in 407 ms. Remains 266 /275 variables (removed 9) and now considering 3797/3830 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 266/275 places, 3797/3830 transitions.
RANDOM walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 109006 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 3
Probabilistic random walk after 109006 steps, saw 36225 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-21 13:18:06] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
// Phase 1: matrix 3632 rows 266 cols
[2024-05-21 13:18:06] [INFO ] Computed 8 invariants in 24 ms
[2024-05-21 13:18:07] [INFO ] State equation strengthened by 276 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1124 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1440/2564 variables, 52/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2564 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2564 variables, 163/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2564 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1253/3817 variables, 114/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3817 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3817 variables, 100/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3817 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/3822 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3822 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3822 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 76/3898 variables, 49/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3898 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3898 variables, 12/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3898/3898 variables, and 550 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1124 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1440/2564 variables, 52/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2564 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2564 variables, 163/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2564 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2564 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1253/3817 variables, 114/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3817 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3817 variables, 100/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3817 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3817 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/3822 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3822 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3822 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 76/3898 variables, 49/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3898 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3898 variables, 12/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:18:11] [INFO ] Deduced a trap composed of 10 places in 480 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3898 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3898 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/3898 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3898/3898 variables, and 554 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4166 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 5694ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1996 ms.
Support contains 4 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 3797/3797 transitions.
Applied a total of 0 rules in 76 ms. Remains 266 /266 variables (removed 0) and now considering 3797/3797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 266/266 places, 3797/3797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 3797/3797 transitions.
Applied a total of 0 rules in 58 ms. Remains 266 /266 variables (removed 0) and now considering 3797/3797 (removed 0) transitions.
[2024-05-21 13:18:14] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
[2024-05-21 13:18:14] [INFO ] Invariant cache hit.
[2024-05-21 13:18:23] [INFO ] Implicit Places using invariants in 8282 ms returned []
[2024-05-21 13:18:23] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
[2024-05-21 13:18:23] [INFO ] Invariant cache hit.
[2024-05-21 13:18:23] [INFO ] State equation strengthened by 276 read => feed constraints.
[2024-05-21 13:18:25] [INFO ] Implicit Places using invariants and state equation in 2359 ms returned []
Implicit Place search using SMT with State Equation took 10667 ms to find 0 implicit places.
[2024-05-21 13:18:25] [INFO ] Redundant transitions in 314 ms returned []
Running 3796 sub problems to find dead transitions.
[2024-05-21 13:18:25] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
[2024-05-21 13:18:25] [INFO ] Invariant cache hit.
[2024-05-21 13:18:25] [INFO ] State equation strengthened by 276 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m008

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.793s, Sys 0.071s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.118s, 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: 646
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..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

Error in allocating array of size 1048576 at unique_table.cc, line 313
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-q8m008"
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-q8m008, 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-171620398100401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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