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-171620398100402.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100402
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716297452304

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
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:17:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 13:17:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:17:35] [INFO ] Load time of PNML (sax parser for PT used): 1146 ms
[2024-05-21 13:17:35] [INFO ] Transformed 754 places.
[2024-05-21 13:17:35] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:17:35] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1449 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Deduced a syphon composed of 474 places in 137 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 93 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 13:17:35] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 13:17:36] [INFO ] Computed 8 invariants in 88 ms
[2024-05-21 13:17:37] [INFO ] Implicit Places using invariants in 1209 ms returned []
[2024-05-21 13:17:37] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:17:37] [INFO ] Invariant cache hit.
[2024-05-21 13:17:38] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 13:17:39] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned []
Implicit Place search using SMT with State Equation took 3778 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 13:17:39] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:17:39] [INFO ] Invariant cache hit.
[2024-05-21 13:17:39] [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 13:18:41] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 15 ms to minimize.
[2024-05-21 13:18:41] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-05-21 13:18:41] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-21 13:18:50] [INFO ] Deduced a trap composed of 11 places in 53 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/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30125 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 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
[2024-05-21 13:19:22] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
Problem TDEAD2716 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-05-21 13:19:23] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
[2024-05-21 13:19:23] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
SMT process timed out in 103468ms, After SMT, problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 55 dead transitions in 103567ms
Found 55 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 55 transitions
Dead transitions reduction (with SMT) removed 55 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3816/3904 transitions.
Reduce places removed 14 places and 433 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 263 transition count 3383
Reduce places removed 7 places and 210 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 21 place count 256 transition count 3173
Reduce places removed 6 places and 168 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 27 place count 250 transition count 3005
Reduce places removed 3 places and 81 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 247 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 246 transition count 2901
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 246 transition count 2901
Applied a total of 32 rules in 56 ms. Remains 246 /277 variables (removed 31) and now considering 2901/3816 (removed 915) transitions.
[2024-05-21 13:19:23] [INFO ] Flow matrix only has 2782 transitions (discarded 119 similar events)
// Phase 1: matrix 2782 rows 246 cols
[2024-05-21 13:19:23] [INFO ] Computed 8 invariants in 28 ms
[2024-05-21 13:19:23] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-21 13:19:23] [INFO ] Flow matrix only has 2782 transitions (discarded 119 similar events)
[2024-05-21 13:19:23] [INFO ] Invariant cache hit.
[2024-05-21 13:19:24] [INFO ] State equation strengthened by 234 read => feed constraints.
[2024-05-21 13:19:25] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 246/280 places, 2901/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109487 ms. Remains : 246/280 places, 2901/3904 transitions.
Support contains 14 out of 246 places after structural reductions.
[2024-05-21 13:19:25] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-21 13:19:25] [INFO ] Flatten gal took : 365 ms
[2024-05-21 13:19:26] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q8m008-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:19:26] [INFO ] Flatten gal took : 224 ms
[2024-05-21 13:19:26] [INFO ] Input system was already deterministic with 2901 transitions.
Support contains 6 out of 246 places (down from 14) after GAL structural reductions.
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40010 steps (258 resets) in 1872 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (47 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (59 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 124277 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 2
Probabilistic random walk after 124277 steps, saw 70614 distinct states, run finished after 3005 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-21 13:19:30] [INFO ] Flow matrix only has 2782 transitions (discarded 119 similar events)
[2024-05-21 13:19:30] [INFO ] Invariant cache hit.
[2024-05-21 13:19:30] [INFO ] State equation strengthened by 234 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 996/1051 variables, 55/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1051 variables, 54/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1051 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1657/2708 variables, 59/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2708 variables, 132/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2708 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/2713 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2713 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 298/3011 variables, 117/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3011 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3011 variables, 48/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3011 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3013 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3013 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 15/3028 variables, 15/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3028 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3028 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/3028 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3028/3028 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 996/1051 variables, 55/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1051 variables, 54/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1051 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1657/2708 variables, 59/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2708 variables, 132/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2708 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/2713 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2713 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 298/3011 variables, 117/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3011 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3011 variables, 48/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3011 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:19:32] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3011 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:19:33] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3011 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3011 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3013 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3013 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 15/3028 variables, 15/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3028 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:19:34] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 2 ms to minimize.
[2024-05-21 13:19:34] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3028 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3028 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/3028 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3028/3028 variables, and 494 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3407 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 4633ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 845 ms.
Support contains 6 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 2901/2901 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 4 place count 244 transition count 2905
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 244 transition count 2900
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 239 transition count 2900
Applied a total of 14 rules in 182 ms. Remains 239 /246 variables (removed 7) and now considering 2900/2901 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 239/246 places, 2900/2901 transitions.
RANDOM walk for 40006 steps (331 resets) in 536 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (62 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (77 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 104132 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 2
Probabilistic random walk after 104132 steps, saw 68424 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-21 13:19:39] [INFO ] Flow matrix only has 2775 transitions (discarded 125 similar events)
// Phase 1: matrix 2775 rows 239 cols
[2024-05-21 13:19:39] [INFO ] Computed 8 invariants in 16 ms
[2024-05-21 13:19:39] [INFO ] State equation strengthened by 235 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 994/1047 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1047 variables, 54/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1047 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1655/2702 variables, 58/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2702 variables, 133/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2702 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/2706 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2706 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 296/3002 variables, 116/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3002 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3002 variables, 48/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3002 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/3014 variables, 12/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3014 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3014 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3014 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3014/3014 variables, and 482 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 239/239 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 994/1047 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1047 variables, 54/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1047 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1655/2702 variables, 58/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2702 variables, 133/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2702 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/2706 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2706 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 296/3002 variables, 116/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3002 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3002 variables, 48/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3002 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:19:42] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3002 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3002 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/3014 variables, 12/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3014 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 13:19:43] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 2 ms to minimize.
[2024-05-21 13:19:43] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 2 ms to minimize.
[2024-05-21 13:19:43] [INFO ] Deduced a trap composed of 40 places in 244 ms of which 1 ms to minimize.
[2024-05-21 13:19:44] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3014 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3014 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/3014 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3014/3014 variables, and 489 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4293 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 239/239 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 5401ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2532 ms.
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 2900/2900 transitions.
Applied a total of 0 rules in 53 ms. Remains 239 /239 variables (removed 0) and now considering 2900/2900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 239/239 places, 2900/2900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 2900/2900 transitions.
Applied a total of 0 rules in 49 ms. Remains 239 /239 variables (removed 0) and now considering 2900/2900 (removed 0) transitions.
[2024-05-21 13:19:47] [INFO ] Flow matrix only has 2775 transitions (discarded 125 similar events)
[2024-05-21 13:19:47] [INFO ] Invariant cache hit.
[2024-05-21 13:19:47] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-21 13:19:47] [INFO ] Flow matrix only has 2775 transitions (discarded 125 similar events)
[2024-05-21 13:19:47] [INFO ] Invariant cache hit.
[2024-05-21 13:19:48] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-05-21 13:19:49] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2024-05-21 13:19:49] [INFO ] Redundant transitions in 155 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-21 13:19:49] [INFO ] Flow matrix only has 2775 transitions (discarded 125 similar events)
[2024-05-21 13:19:49] [INFO ] Invariant cache hit.
[2024-05-21 13:19:49] [INFO ] State equation strengthened by 235 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.842s, Sys 0.047s]


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 665
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:
++ 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 CTLFireability -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="CTLFireability"
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 CTLFireability"
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-171620398100402"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;