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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K 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 50K 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.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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-q8m128-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716300783975

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:13:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:13:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:13:06] [INFO ] Load time of PNML (sax parser for PT used): 1067 ms
[2024-05-21 14:13:07] [INFO ] Transformed 754 places.
[2024-05-21 14:13:07] [INFO ] Transformed 27370 transitions.
[2024-05-21 14:13:07] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1330 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 474 places in 166 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA BugTracking-PT-q8m128-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 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 103 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 14:13:07] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 14:13:07] [INFO ] Computed 8 invariants in 65 ms
[2024-05-21 14:13:10] [INFO ] Implicit Places using invariants in 2322 ms returned []
[2024-05-21 14:13:10] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 14:13:10] [INFO ] Invariant cache hit.
[2024-05-21 14:13:10] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 14:13:13] [INFO ] Implicit Places using invariants and state equation in 3440 ms returned []
Implicit Place search using SMT with State Equation took 5800 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 14:13:13] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 14:13:13] [INFO ] Invariant cache hit.
[2024-05-21 14:13:13] [INFO ] State equation strengthened by 282 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 8 constraints, problems are : Problem set: 0 solved, 3869 unsolved in 30221 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3869 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-05-21 14:14:29] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 34 ms to minimize.
[2024-05-21 14:14:29] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-21 14:14:45] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 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 276/3984 variables, and 11 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 3/3 constraints]
After SMT, in 104055ms problems are : Problem set: 14 solved, 3855 unsolved
Search for dead transitions found 14 dead transitions in 104128ms
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 : 277/280 places, 3857/3904 transitions.
Reduce places removed 2 places and 35 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 275 transition count 3822
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 274 transition count 3797
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 274 transition count 3797
Applied a total of 4 rules in 176 ms. Remains 274 /277 variables (removed 3) and now considering 3797/3857 (removed 60) transitions.
[2024-05-21 14:14:57] [INFO ] Flow matrix only has 3640 transitions (discarded 157 similar events)
// Phase 1: matrix 3640 rows 274 cols
[2024-05-21 14:14:57] [INFO ] Computed 8 invariants in 37 ms
[2024-05-21 14:14:58] [INFO ] Implicit Places using invariants in 806 ms returned []
[2024-05-21 14:14:58] [INFO ] Flow matrix only has 3640 transitions (discarded 157 similar events)
[2024-05-21 14:14:58] [INFO ] Invariant cache hit.
[2024-05-21 14:14:59] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-21 14:15:00] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2650 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 274/280 places, 3797/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112907 ms. Remains : 274/280 places, 3797/3904 transitions.
Support contains 8 out of 274 places after structural reductions.
[2024-05-21 14:15:01] [INFO ] Flatten gal took : 411 ms
[2024-05-21 14:15:01] [INFO ] Flatten gal took : 229 ms
[2024-05-21 14:15:02] [INFO ] Input system was already deterministic with 3797 transitions.
RANDOM walk for 40000 steps (25 resets) in 1986 ms. (20 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 314 ms. (126 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 4/4 properties
[2024-05-21 14:15:03] [INFO ] Flow matrix only has 3640 transitions (discarded 157 similar events)
[2024-05-21 14:15:03] [INFO ] Invariant cache hit.
[2024-05-21 14:15:03] [INFO ] State equation strengthened by 275 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/74 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1907/1981 variables, 74/77 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1981 variables, 3/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1981 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1261/3242 variables, 114/194 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3242 variables, 1/195 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3242 variables, 199/394 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3242 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3248 variables, 2/396 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3248 variables, 1/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3248 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 613/3861 variables, 56/453 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3861 variables, 66/519 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3861 variables, 0/519 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/3865 variables, 1/520 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3865 variables, 0/520 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 49/3914 variables, 29/549 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3914 variables, 1/550 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3914 variables, 7/557 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3914 variables, 0/557 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/3914 variables, 0/557 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3914/3914 variables, and 557 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 274/274 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 595/621 variables, 26/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 2/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2484/3105 variables, 78/107 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3105 variables, 2/109 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3105 variables, 187/296 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3105 variables, 1/297 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3105 variables, 0/297 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/3113 variables, 2/299 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3113 variables, 1/300 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3113 variables, 0/300 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 720/3833 variables, 135/435 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3833 variables, 1/436 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3833 variables, 72/508 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3833 variables, 1/509 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:15:06] [INFO ] Deduced a trap composed of 36 places in 364 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3833 variables, 1/510 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3833 variables, 0/510 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 79/3912 variables, 32/542 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3912 variables, 1/543 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3912 variables, 14/557 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3912 variables, 0/557 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3914 variables, 1/558 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3914 variables, 2/560 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 14:15:08] [INFO ] Deduced a trap composed of 21 places in 515 ms of which 2 ms to minimize.
[2024-05-21 14:15:09] [INFO ] Deduced a trap composed of 12 places in 463 ms of which 1 ms to minimize.
[2024-05-21 14:15:09] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3914 variables, 3/563 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3914/3914 variables, and 563 constraints, problems are : Problem set: 2 solved, 2 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 274/274 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 6750ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 3797/3797 transitions.
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 4 place count 272 transition count 3803
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 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 16 place count 266 transition count 3797
Applied a total of 16 rules in 320 ms. Remains 266 /274 variables (removed 8) and now considering 3797/3797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 266/274 places, 3797/3797 transitions.
RANDOM walk for 40279 steps (8 resets) in 565 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1166 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 87784 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 2
Probabilistic random walk after 87784 steps, saw 35094 distinct states, run finished after 3006 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-21 14:15:14] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
// Phase 1: matrix 3632 rows 266 cols
[2024-05-21 14:15:14] [INFO ] Computed 8 invariants in 17 ms
[2024-05-21 14:15:14] [INFO ] State equation strengthened by 276 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 595/621 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2480/3101 variables, 76/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3101 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3101 variables, 189/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/3106 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3106 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3106 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 717/3823 variables, 132/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3823 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3823 variables, 71/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3823 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 75/3898 variables, 31/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3898 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3898 variables, 14/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3898/3898 variables, and 550 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 595/621 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2480/3101 variables, 76/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3101 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3101 variables, 189/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/3106 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3106 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3106 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 717/3823 variables, 132/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3823 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3823 variables, 71/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3823 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:15:17] [INFO ] Deduced a trap composed of 17 places in 771 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3823 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3823 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 75/3898 variables, 31/537 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3898 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3898 variables, 14/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:15:19] [INFO ] Deduced a trap composed of 92 places in 858 ms of which 2 ms to minimize.
[2024-05-21 14:15:20] [INFO ] Deduced a trap composed of 78 places in 832 ms of which 2 ms to minimize.
[2024-05-21 14:15:20] [INFO ] Deduced a trap composed of 68 places in 397 ms of which 23 ms to minimize.
[2024-05-21 14:15:21] [INFO ] Deduced a trap composed of 77 places in 534 ms of which 5 ms to minimize.
[2024-05-21 14:15:21] [INFO ] Deduced a trap composed of 91 places in 509 ms of which 2 ms to minimize.
[2024-05-21 14:15:22] [INFO ] Deduced a trap composed of 68 places in 371 ms of which 3 ms to minimize.
[2024-05-21 14:15:22] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/3898 variables, 7/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3898 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/3898 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3898/3898 variables, and 560 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7913 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 9430ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2618 ms.
Support contains 3 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 145 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 146 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 143 ms. Remains 266 /266 variables (removed 0) and now considering 3797/3797 (removed 0) transitions.
[2024-05-21 14:15:26] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
[2024-05-21 14:15:26] [INFO ] Invariant cache hit.
[2024-05-21 14:15:26] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-21 14:15:26] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
[2024-05-21 14:15:26] [INFO ] Invariant cache hit.
[2024-05-21 14:15:27] [INFO ] State equation strengthened by 276 read => feed constraints.
[2024-05-21 14:15:28] [INFO ] Implicit Places using invariants and state equation in 1919 ms returned []
Implicit Place search using SMT with State Equation took 2467 ms to find 0 implicit places.
[2024-05-21 14:15:29] [INFO ] Redundant transitions in 304 ms returned []
Running 3796 sub problems to find dead transitions.
[2024-05-21 14:15:29] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
[2024-05-21 14:15:29] [INFO ] Invariant cache hit.
[2024-05-21 14:15:29] [INFO ] State equation strengthened by 276 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m128

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.650s, Sys 0.059s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.117s, 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: 661
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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716302204834

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 349067608 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m128"
export BK_EXAMINATION="LTLCardinality"
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-q8m128, examination is LTLCardinality"
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-171620398200435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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