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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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:23 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-q3m004-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q3m004-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716294227226

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:23:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 12:23:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:23:50] [INFO ] Load time of PNML (sax parser for PT used): 1219 ms
[2024-05-21 12:23:50] [INFO ] Transformed 754 places.
[2024-05-21 12:23:50] [INFO ] Transformed 27370 transitions.
[2024-05-21 12:23:50] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1655 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Deduced a syphon composed of 514 places in 98 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 170 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-05-21 12:23:51] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-21 12:23:51] [INFO ] Computed 8 invariants in 54 ms
[2024-05-21 12:23:52] [INFO ] Implicit Places using invariants in 1119 ms returned []
[2024-05-21 12:23:52] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 12:23:52] [INFO ] Invariant cache hit.
[2024-05-21 12:23:53] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-21 12:23:54] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned []
Implicit Place search using SMT with State Equation took 3551 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-05-21 12:23:55] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 12:23:55] [INFO ] Invariant cache hit.
[2024-05-21 12:23:55] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
[2024-05-21 12:24:39] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 16 ms to minimize.
[2024-05-21 12:24:39] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 2 ms to minimize.
[2024-05-21 12:24:39] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 2 ms to minimize.
[2024-05-21 12:24:46] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2863 variables, and 12 constraints, problems are : Problem set: 14 solved, 2734 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 2748/2748 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 2734 unsolved
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 4/12 constraints. Problems are: Problem set: 43 solved, 2705 unsolved
[2024-05-21 12:25:24] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
Problem TDEAD2319 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2863 variables, and 13 constraints, problems are : Problem set: 44 solved, 2704 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 0/2748 constraints, Known Traps: 5/5 constraints]
After SMT, in 89633ms problems are : Problem set: 44 solved, 2704 unsolved
Search for dead transitions found 44 dead transitions in 89818ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2706/2769 transitions.
Reduce places removed 8 places and 220 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 229 transition count 2486
Reduce places removed 3 places and 73 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 11 place count 226 transition count 2413
Reduce places removed 6 places and 150 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 17 place count 220 transition count 2263
Reduce places removed 3 places and 89 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 217 transition count 2174
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 20 rules in 45 ms. Remains 217 /237 variables (removed 20) and now considering 2174/2706 (removed 532) transitions.
[2024-05-21 12:25:24] [INFO ] Flow matrix only has 2074 transitions (discarded 100 similar events)
// Phase 1: matrix 2074 rows 217 cols
[2024-05-21 12:25:24] [INFO ] Computed 10 invariants in 21 ms
[2024-05-21 12:25:25] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-21 12:25:25] [INFO ] Flow matrix only has 2074 transitions (discarded 100 similar events)
[2024-05-21 12:25:25] [INFO ] Invariant cache hit.
[2024-05-21 12:25:25] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-21 12:25:27] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 217/240 places, 2174/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96011 ms. Remains : 217/240 places, 2174/2769 transitions.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Support contains 16 out of 215 places after structural reductions.
[2024-05-21 12:25:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 12:25:28] [INFO ] Flatten gal took : 379 ms
[2024-05-21 12:25:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 12:25:28] [INFO ] Flatten gal took : 286 ms
[2024-05-21 12:25:28] [INFO ] Input system was already deterministic with 2174 transitions.
Support contains 8 out of 215 places (down from 16) after GAL structural reductions.
FORMULA BugTracking-PT-q3m004-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (433 resets) in 2764 ms. (14 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (94 resets) in 257 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (113 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (110 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (121 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (118 resets) in 313 ms. (127 steps per ms) remains 5/5 properties
[2024-05-21 12:25:30] [INFO ] Flow matrix only has 2074 transitions (discarded 100 similar events)
// Phase 1: matrix 2074 rows 215 cols
[2024-05-21 12:25:30] [INFO ] Computed 8 invariants in 9 ms
[2024-05-21 12:25:30] [INFO ] State equation strengthened by 203 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/52 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 748/800 variables, 52/55 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/800 variables, 7/62 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/800 variables, 0/62 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 731/1531 variables, 83/145 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1531 variables, 3/148 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1531 variables, 159/307 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1531 variables, 0/307 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1532 variables, 1/308 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1532 variables, 1/309 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1532 variables, 0/309 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 726/2258 variables, 49/358 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2258 variables, 36/394 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2258 variables, 0/394 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 31/2289 variables, 30/424 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2289 variables, 1/425 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2289 variables, 1/426 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2289 variables, 0/426 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2289 variables, 0/426 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2289/2289 variables, and 426 constraints, problems are : Problem set: 3 solved, 2 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 215/215 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1319/1397 variables, 54/60 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1397 variables, 2/62 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1397 variables, 134/196 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1397 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1397 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/1408 variables, 3/200 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1408 variables, 0/200 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 823/2231 variables, 126/326 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2231 variables, 2/328 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2231 variables, 60/388 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2231 variables, 1/389 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2231 variables, 0/389 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 57/2288 variables, 31/420 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2288 variables, 1/421 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2288 variables, 6/427 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2288 variables, 0/427 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/2289 variables, 1/428 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2289 variables, 0/428 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2289 variables, 0/428 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2289/2289 variables, and 428 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 215/215 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1999ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 528 ms.
Support contains 3 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 2174/2174 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 214 transition count 2148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 2148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 212 transition count 2150
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 212 transition count 2144
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 206 transition count 2144
Applied a total of 18 rules in 207 ms. Remains 206 /215 variables (removed 9) and now considering 2144/2174 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 206/215 places, 2144/2174 transitions.
RANDOM walk for 40004 steps (11 resets) in 699 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 276 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 151871 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 151871 steps, saw 65989 distinct states, run finished after 3013 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-21 12:25:36] [INFO ] Flow matrix only has 2042 transitions (discarded 102 similar events)
// Phase 1: matrix 2042 rows 206 cols
[2024-05-21 12:25:36] [INFO ] Computed 8 invariants in 17 ms
[2024-05-21 12:25:36] [INFO ] State equation strengthened by 204 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) 75/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1329/1407 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1407 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1407 variables, 142/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1407 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/1413 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1413 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1413 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 782/2195 variables, 118/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2195 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2195 variables, 53/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2195 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 53/2248 variables, 29/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2248 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2248 variables, 6/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2248 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2248 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2248/2248 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 206/206 constraints, ReadFeed: 204/204 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) 75/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1329/1407 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1407 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1407 variables, 142/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1407 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1407 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/1413 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1413 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1413 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 782/2195 variables, 118/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2195 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2195 variables, 53/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2195 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 12:25:37] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 1 ms to minimize.
[2024-05-21 12:25:38] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2024-05-21 12:25:38] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2024-05-21 12:25:38] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2195 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2195 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 53/2248 variables, 29/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2248 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2248 variables, 6/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2248 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2248 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2248/2248 variables, and 424 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 206/206 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2600ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 594 ms.
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2144/2144 transitions.
Applied a total of 0 rules in 94 ms. Remains 206 /206 variables (removed 0) and now considering 2144/2144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 206/206 places, 2144/2144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2144/2144 transitions.
Applied a total of 0 rules in 81 ms. Remains 206 /206 variables (removed 0) and now considering 2144/2144 (removed 0) transitions.
[2024-05-21 12:25:39] [INFO ] Flow matrix only has 2042 transitions (discarded 102 similar events)
[2024-05-21 12:25:39] [INFO ] Invariant cache hit.
[2024-05-21 12:25:40] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-21 12:25:40] [INFO ] Flow matrix only has 2042 transitions (discarded 102 similar events)
[2024-05-21 12:25:40] [INFO ] Invariant cache hit.
[2024-05-21 12:25:40] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-21 12:25:42] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
[2024-05-21 12:25:42] [INFO ] Redundant transitions in 210 ms returned []
Running 2143 sub problems to find dead transitions.
[2024-05-21 12:25:42] [INFO ] Flow matrix only has 2042 transitions (discarded 102 similar events)
[2024-05-21 12:25:42] [INFO ] Invariant cache hit.
[2024-05-21 12:25:42] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2143 unsolved
[2024-05-21 12:26:17] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
[2024-05-21 12:26:17] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
[2024-05-21 12:26:17] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
[2024-05-21 12:26:22] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
[2024-05-21 12:26:22] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
Problem TDEAD2132 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 5/13 constraints. Problems are: Problem set: 370 solved, 1773 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/13 constraints. Problems are: Problem set: 370 solved, 1773 unsolved
At refinement iteration 3 (OVERLAPS) 2042/2248 variables, 206/219 constraints. Problems are: Problem set: 370 solved, 1773 unsolved
SMT process timed out in 49853ms, After SMT, problems are : Problem set: 370 solved, 1773 unsolved
Search for dead transitions found 370 dead transitions in 49882ms
Found 370 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 370 transitions
Dead transitions reduction (with SMT) removed 370 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/206 places, 1774/2144 transitions.
Reduce places removed 21 places and 368 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 185 transition count 1406
Reduce places removed 18 places and 188 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 167 transition count 1218
Reduce places removed 3 places and 51 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 164 transition count 1167
Reduce places removed 5 places and 40 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 47 place count 159 transition count 1127
Reduce places removed 2 places and 65 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 49 place count 157 transition count 1062
Reduce places removed 3 places and 52 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 52 place count 154 transition count 1010
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 64 place count 142 transition count 953
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 15 places and 223 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 91 place count 127 transition count 730
Graph (complete) has 995 edges and 127 vertex of which 3 are kept as prefixes of interest. Removing 124 places using SCC suffix rule.1 ms
Discarding 124 places :
Also discarding 730 output transitions
Drop transitions (Output transitions of discarded places.) removed 730 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 92 place count 3 transition count 0
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 92 rules in 54 ms. Remains 3 /206 variables (removed 203) and now considering 0/1774 (removed 1774) transitions.
[2024-05-21 12:26:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 12:26:32] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 12:26:32] [INFO ] Invariant cache hit.
[2024-05-21 12:26:32] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3/206 places, 0/2144 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 53114 ms. Remains : 3/206 places, 0/2144 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Successfully simplified 5 atomic propositions for a total of 4 simplifications.
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 12:26:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 12:26:32] [INFO ] Flatten gal took : 130 ms
FORMULA BugTracking-PT-q3m004-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 12:26:33] [INFO ] Flatten gal took : 139 ms
[2024-05-21 12:26:33] [INFO ] Input system was already deterministic with 2174 transitions.
Computed a total of 5 stabilizing places and 86 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 2174/2174 transitions.
Applied a total of 0 rules in 9 ms. Remains 215 /215 variables (removed 0) and now considering 2174/2174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 215/215 places, 2174/2174 transitions.
[2024-05-21 12:26:33] [INFO ] Flatten gal took : 104 ms
[2024-05-21 12:26:33] [INFO ] Flatten gal took : 103 ms
[2024-05-21 12:26:33] [INFO ] Input system was already deterministic with 2174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 2174/2174 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 214 transition count 2148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 2148
Applied a total of 2 rules in 15 ms. Remains 214 /215 variables (removed 1) and now considering 2148/2174 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 214/215 places, 2148/2174 transitions.
[2024-05-21 12:26:33] [INFO ] Flatten gal took : 84 ms
[2024-05-21 12:26:34] [INFO ] Flatten gal took : 95 ms
[2024-05-21 12:26:34] [INFO ] Input system was already deterministic with 2148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 2174/2174 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 214 transition count 2148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 2148
Applied a total of 2 rules in 16 ms. Remains 214 /215 variables (removed 1) and now considering 2148/2174 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 214/215 places, 2148/2174 transitions.
[2024-05-21 12:26:34] [INFO ] Flatten gal took : 64 ms
[2024-05-21 12:26:34] [INFO ] Flatten gal took : 78 ms
[2024-05-21 12:26:34] [INFO ] Input system was already deterministic with 2148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 2174/2174 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 214 transition count 2148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 2148
Applied a total of 2 rules in 14 ms. Remains 214 /215 variables (removed 1) and now considering 2148/2174 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 214/215 places, 2148/2174 transitions.
[2024-05-21 12:26:34] [INFO ] Flatten gal took : 68 ms
[2024-05-21 12:26:34] [INFO ] Flatten gal took : 74 ms
[2024-05-21 12:26:34] [INFO ] Input system was already deterministic with 2148 transitions.
[2024-05-21 12:26:34] [INFO ] Flatten gal took : 69 ms
[2024-05-21 12:26:35] [INFO ] Flatten gal took : 70 ms
[2024-05-21 12:26:35] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-05-21 12:26:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 215 places, 2174 transitions and 10623 arcs took 20 ms.
Total runtime 165939 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q3m004

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 215
TRANSITIONS: 2174
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.091s, Sys 0.006s]


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


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

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

Process ID: 671
MODEL NAME: /home/mcc/execution/418/model
215 places, 2174 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 16777216 at unique_table.cc, line 313
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-q3m004"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BugTracking-PT-q3m004, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398000329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m004.tgz
mv BugTracking-PT-q3m004 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;