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.r472-tajo-171620399300356.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 ltsminxred
Input is BugTracking-PT-q3m032, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399300356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 02:28 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-q3m032-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717223436493

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:30:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:30:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:30:38] [INFO ] Load time of PNML (sax parser for PT used): 816 ms
[2024-06-01 06:30:38] [INFO ] Transformed 754 places.
[2024-06-01 06:30:38] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:30:38] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1023 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 514 places in 88 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m032-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 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 88 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-06-01 06:30:39] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-06-01 06:30:39] [INFO ] Computed 8 invariants in 42 ms
[2024-06-01 06:30:39] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-01 06:30:39] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:30:39] [INFO ] Invariant cache hit.
[2024-06-01 06:30:40] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-06-01 06:30:41] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-06-01 06:30:41] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:30:41] [INFO ] Invariant cache hit.
[2024-06-01 06:30:41] [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-06-01 06:31:19] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 15 ms to minimize.
[2024-06-01 06:31:19] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2024-06-01 06:31:20] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2024-06-01 06:31:26] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 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
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
Problem TDEAD2319 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2333 is UNSAT
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
Problem TDEAD2342 is UNSAT
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 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
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
Problem TDEAD2693 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
Problem TDEAD2705 is UNSAT
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
SMT process timed out in 57240ms, After SMT, problems are : Problem set: 0 solved, 2748 unsolved
Search for dead transitions found 0 dead transitions in 57312ms
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59619 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 13 out of 237 places after structural reductions.
[2024-06-01 06:31:39] [INFO ] Flatten gal took : 298 ms
[2024-06-01 06:31:39] [INFO ] Flatten gal took : 193 ms
[2024-06-01 06:31:39] [INFO ] Input system was already deterministic with 2750 transitions.
RANDOM walk for 40000 steps (71 resets) in 1611 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 471 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 153024 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 6
Probabilistic random walk after 153024 steps, saw 77853 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 06:31:43] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:31:43] [INFO ] Invariant cache hit.
[2024-06-01 06:31:43] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 79/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:31:44] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
Problem AtomicPropp4 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1958/2050 variables, 92/97 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2050 variables, 134/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2050 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 758/2808 variables, 93/324 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2808 variables, 106/430 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2808 variables, 0/430 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 5/2813 variables, 2/432 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2813 variables, 0/432 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 50/2863 variables, 52/484 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2863 variables, 2/486 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2863 variables, 0/486 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2863 variables, 0/486 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 486 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 237/237 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 55/65 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1623/1688 variables, 65/67 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 86/153 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1688 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1059/2747 variables, 82/235 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2747 variables, 145/380 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2747 variables, 1/381 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2747 variables, 0/381 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 10/2757 variables, 3/384 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2757 variables, 0/384 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 106/2863 variables, 90/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2863 variables, 3/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2863 variables, 9/486 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2863 variables, 4/490 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2863 variables, 1/491 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 2 ms to minimize.
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 2 ms to minimize.
Problem AtomicPropp5 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/2863 variables, 2/493 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2863 variables, 0/493 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/2863 variables, 0/493 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2863/2863 variables, and 493 constraints, problems are : Problem set: 2 solved, 4 unsolved in 4878 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 237/237 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 6538ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 35595 ms.
Support contains 8 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 235 transition count 2753
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 230 transition count 2748
Applied a total of 14 rules in 160 ms. Remains 230 /237 variables (removed 7) and now considering 2748/2750 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 230/237 places, 2748/2750 transitions.
RANDOM walk for 40013 steps (124 resets) in 529 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (16 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (15 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (17 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (12 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 125804 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 125804 steps, saw 82446 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-06-01 06:32:29] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2024-06-01 06:32:29] [INFO ] Computed 8 invariants in 15 ms
[2024-06-01 06:32:29] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1622/1686 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1686 variables, 86/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1686 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1057/2743 variables, 82/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2743 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2743 variables, 146/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2743 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/2748 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2748 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 101/2849 variables, 84/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2849 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2849 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2849 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/2849 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2849/2849 variables, and 479 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1622/1686 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1686 variables, 86/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1686 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1057/2743 variables, 82/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2743 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2743 variables, 146/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2743 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2743 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/2748 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2748 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 101/2849 variables, 84/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2849 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2849 variables, 9/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2849 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:32:32] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:32:33] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:32:33] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-06-01 06:32:33] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 3 ms to minimize.
[2024-06-01 06:32:33] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2849 variables, 5/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2849 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/2849 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2849/2849 variables, and 488 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4538 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 5889ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 12586 ms.
Support contains 8 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 36 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 34 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2024-06-01 06:32:48] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-06-01 06:32:48] [INFO ] Invariant cache hit.
[2024-06-01 06:32:48] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 06:32:48] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-06-01 06:32:48] [INFO ] Invariant cache hit.
[2024-06-01 06:32:48] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:32:49] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
[2024-06-01 06:32:49] [INFO ] Redundant transitions in 185 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-06-01 06:32:49] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-06-01 06:32:49] [INFO ] Invariant cache hit.
[2024-06-01 06:32:49] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
Problem TDEAD2293 is UNSAT
Problem TDEAD2294 is UNSAT
Problem TDEAD2295 is UNSAT
Problem TDEAD2296 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2299 is UNSAT
Problem TDEAD2302 is UNSAT
Problem TDEAD2303 is UNSAT
Problem TDEAD2304 is UNSAT
Problem TDEAD2305 is UNSAT
Problem TDEAD2308 is UNSAT
Problem TDEAD2309 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2314 is UNSAT
Problem TDEAD2315 is UNSAT
Problem TDEAD2316 is UNSAT
Problem TDEAD2317 is UNSAT
Problem TDEAD2319 is UNSAT
Problem TDEAD2320 is UNSAT
Problem TDEAD2323 is UNSAT
Problem TDEAD2324 is UNSAT
Problem TDEAD2325 is UNSAT
Problem TDEAD2326 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2331 is UNSAT
Problem TDEAD2332 is UNSAT
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 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 TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 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
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2593 is UNSAT
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
Problem TDEAD2632 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD2269 is UNSAT
Problem TDEAD2270 is UNSAT
Problem TDEAD2271 is UNSAT
Problem TDEAD2272 is UNSAT
Problem TDEAD2273 is UNSAT
Problem TDEAD2274 is UNSAT
Problem TDEAD2275 is UNSAT
Problem TDEAD2280 is UNSAT
Problem TDEAD2281 is UNSAT
Problem TDEAD2282 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2284 is UNSAT
Problem TDEAD2285 is UNSAT
Problem TDEAD2286 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2288 is UNSAT
Problem TDEAD2289 is UNSAT
Problem TDEAD2290 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 10/18 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/2849 variables, and 18 constraints, problems are : Problem set: 198 solved, 2548 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 198 solved, 2548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 7/7 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 10/17 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/17 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
At refinement iteration 3 (OVERLAPS) 8/230 variables, 1/18 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/2849 variables, and 18 constraints, problems are : Problem set: 198 solved, 2548 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 10/10 constraints]
After SMT, in 86352ms problems are : Problem set: 198 solved, 2548 unsolved
Search for dead transitions found 198 dead transitions in 86383ms
Found 198 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 198 transitions
Dead transitions reduction (with SMT) removed 198 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/230 places, 2550/2748 transitions.
Graph (complete) has 3104 edges and 230 vertex of which 222 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 551 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 203 transition count 1999
Reduce places removed 13 places and 257 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 33 place count 190 transition count 1742
Reduce places removed 6 places and 141 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 39 place count 184 transition count 1601
Reduce places removed 4 places and 77 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 43 place count 180 transition count 1524
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 52 place count 171 transition count 1407
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 120 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 68 place count 164 transition count 1287
Applied a total of 68 rules in 68 ms. Remains 164 /230 variables (removed 66) and now considering 1287/2550 (removed 1263) transitions.
[2024-06-01 06:34:16] [INFO ] Flow matrix only has 1202 transitions (discarded 85 similar events)
// Phase 1: matrix 1202 rows 164 cols
[2024-06-01 06:34:16] [INFO ] Computed 7 invariants in 6 ms
[2024-06-01 06:34:16] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 06:34:16] [INFO ] Flow matrix only has 1202 transitions (discarded 85 similar events)
[2024-06-01 06:34:16] [INFO ] Invariant cache hit.
[2024-06-01 06:34:16] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-06-01 06:34:17] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 164/230 places, 1287/2748 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 89325 ms. Remains : 164/230 places, 1287/2748 transitions.
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
FORMULA BugTracking-PT-q3m032-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 14 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2024-06-01 06:34:17] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-06-01 06:34:17] [INFO ] Computed 8 invariants in 14 ms
[2024-06-01 06:34:17] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 06:34:17] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:34:17] [INFO ] Invariant cache hit.
[2024-06-01 06:34:18] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-06-01 06:34:18] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-06-01 06:34:19] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:34:19] [INFO ] Invariant cache hit.
[2024-06-01 06:34:19] [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-06-01 06:34:56] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:35:03] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 6 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
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
Problem TDEAD2319 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2333 is UNSAT
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
Problem TDEAD2342 is UNSAT
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 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
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
Problem TDEAD2693 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
Problem TDEAD2705 is UNSAT
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 16/24 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2863 variables, and 24 constraints, problems are : Problem set: 522 solved, 2226 unsolved in 30033 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: 16/16 constraints]
Escalating to Integer solving :Problem set: 522 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 7/7 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 13/20 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/20 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
At refinement iteration 3 (OVERLAPS) 8/236 variables, 1/21 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 3/24 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/24 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
At refinement iteration 6 (OVERLAPS) 2626/2862 variables, 236/260 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2862 variables, 240/500 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2862/2863 variables, and 2566 constraints, problems are : Problem set: 522 solved, 2226 unsolved in 34620 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 236/237 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 2066/2748 constraints, Known Traps: 16/16 constraints]
After SMT, in 91519ms problems are : Problem set: 522 solved, 2226 unsolved
Search for dead transitions found 522 dead transitions in 91551ms
Found 522 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 522 transitions
Dead transitions reduction (with SMT) removed 522 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/237 places, 2228/2750 transitions.
Reduce places removed 44 places and 709 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 193 transition count 1519
Reduce places removed 15 places and 265 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 59 place count 178 transition count 1254
Reduce places removed 12 places and 125 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 71 place count 166 transition count 1129
Reduce places removed 6 places and 84 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 77 place count 160 transition count 1045
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 159 transition count 1028
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 89 place count 148 transition count 972
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 225 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 116 place count 132 transition count 747
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 124 place count 124 transition count 691
Iterating global reduction 5 with 8 rules applied. Total rules applied 132 place count 124 transition count 691
Applied a total of 132 rules in 17 ms. Remains 124 /237 variables (removed 113) and now considering 691/2228 (removed 1537) transitions.
[2024-06-01 06:35:50] [INFO ] Flow matrix only has 633 transitions (discarded 58 similar events)
// Phase 1: matrix 633 rows 124 cols
[2024-06-01 06:35:50] [INFO ] Computed 9 invariants in 6 ms
[2024-06-01 06:35:50] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 06:35:50] [INFO ] Flow matrix only has 633 transitions (discarded 58 similar events)
[2024-06-01 06:35:50] [INFO ] Invariant cache hit.
[2024-06-01 06:35:50] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 06:35:51] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/237 places, 691/2750 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93701 ms. Remains : 124/237 places, 691/2750 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m032-LTLFireability-01
Stuttering criterion allowed to conclude after 579 steps with 0 reset in 17 ms.
FORMULA BugTracking-PT-q3m032-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m032-LTLFireability-01 finished in 93969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&X(p0)))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 9 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2024-06-01 06:35:51] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-06-01 06:35:51] [INFO ] Computed 8 invariants in 8 ms
[2024-06-01 06:35:51] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-01 06:35:51] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:35:51] [INFO ] Invariant cache hit.
[2024-06-01 06:35:51] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-06-01 06:35:52] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-06-01 06:35:52] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:35:52] [INFO ] Invariant cache hit.
[2024-06-01 06:35:52] [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-06-01 06:36:29] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 12 ms to minimize.
[2024-06-01 06:36:29] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 9 ms to minimize.
[2024-06-01 06:36:29] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 5 ms to minimize.
FORMULA BugTracking-PT-q3m032-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q3m032-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q3m032-LTLFireability-02
FORMULA BugTracking-PT-q3m032-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q3m032-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q3m032-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q3m032-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q3m032-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q3m032-LTLFireability-08
FORMULA BugTracking-PT-q3m032-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q3m032-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q3m032-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q3m032-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q3m032-LTLFireability-13
FORMULA BugTracking-PT-q3m032-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q3m032-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717224555120

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BugTracking-PT-q3m032-LTLFireability-00
ltl formula formula --ltl=/tmp/783/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.040 real 1.010 user 0.850 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27385 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 121
pnml2lts-mc( 0/ 4): unique transitions count: 330
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 127
pnml2lts-mc( 0/ 4): - cum. max stack depth: 127
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 127 states 346 transitions, fanout: 2.724
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.130 sec minimum, 0.135 sec on average)
pnml2lts-mc( 0/ 4): States per second: 907, Transitions per second: 2471
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 57.8 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-01
ltl formula formula --ltl=/tmp/783/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.360 real 1.040 user 0.960 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27372 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 128
pnml2lts-mc( 0/ 4): unique transitions count: 373
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 133
pnml2lts-mc( 0/ 4): - cum. max stack depth: 133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 133 states 388 transitions, fanout: 2.917
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.120 sec minimum, 0.127 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1023, Transitions per second: 2985
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 64.7 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-02
ltl formula formula --ltl=/tmp/783/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.250 real 1.050 user 1.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27374 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2327 levels ~10000 states ~21076 transitions
pnml2lts-mc( 2/ 4): ~4696 levels ~20000 states ~42420 transitions
pnml2lts-mc( 2/ 4): ~9432 levels ~40000 states ~85048 transitions
pnml2lts-mc( 2/ 4): ~18906 levels ~80000 states ~170320 transitions
pnml2lts-mc( 2/ 4): ~37854 levels ~160000 states ~340836 transitions
ltl formula name BugTracking-PT-q3m032-LTLFireability-03
ltl formula formula --ltl=/tmp/783/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.760 real 0.930 user 1.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27375 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 77
pnml2lts-mc( 0/ 4): unique transitions count: 208
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 80
pnml2lts-mc( 0/ 4): - cum. max stack depth: 80
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 80 states 230 transitions, fanout: 2.875
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.050 sec minimum, 0.065 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1143, Transitions per second: 3286
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 68.5 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-04
ltl formula formula --ltl=/tmp/783/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.760 real 0.970 user 1.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27377 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~34!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 123
pnml2lts-mc( 0/ 4): unique transitions count: 710
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 161
pnml2lts-mc( 0/ 4): - cum. max stack depth: 161
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 161 states 932 transitions, fanout: 5.789
pnml2lts-mc( 0/ 4): Total exploration time 0.170 sec (0.160 sec minimum, 0.167 sec on average)
pnml2lts-mc( 0/ 4): States per second: 947, Transitions per second: 5482
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 42.1 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-05
ltl formula formula --ltl=/tmp/783/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.660 real 1.100 user 1.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27383 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 124
pnml2lts-mc( 0/ 4): unique transitions count: 354
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 129
pnml2lts-mc( 0/ 4): - cum. max stack depth: 129
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 129 states 369 transitions, fanout: 2.860
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.120 sec minimum, 0.127 sec on average)
pnml2lts-mc( 0/ 4): States per second: 992, Transitions per second: 2838
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 64.8 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-06
ltl formula formula --ltl=/tmp/783/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.720 real 1.080 user 1.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27383 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 125
pnml2lts-mc( 0/ 4): unique transitions count: 338
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 131
pnml2lts-mc( 0/ 4): - cum. max stack depth: 131
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 131 states 354 transitions, fanout: 2.702
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.130 sec minimum, 0.137 sec on average)
pnml2lts-mc( 0/ 4): States per second: 936, Transitions per second: 2529
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 61.9 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-07
ltl formula formula --ltl=/tmp/783/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.490 real 1.150 user 0.910 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27382 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 101
pnml2lts-mc( 0/ 4): unique transitions count: 293
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 107
pnml2lts-mc( 0/ 4): - cum. max stack depth: 107
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 107 states 309 transitions, fanout: 2.888
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.090 sec minimum, 0.105 sec on average)
pnml2lts-mc( 0/ 4): States per second: 973, Transitions per second: 2809
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 58.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-08
ltl formula formula --ltl=/tmp/783/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.350 real 1.080 user 1.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27377 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~29856 transitions
pnml2lts-mc( 2/ 4): ~4392 levels ~20000 states ~47028 transitions
pnml2lts-mc( 2/ 4): ~8906 levels ~40000 states ~94776 transitions
pnml2lts-mc( 2/ 4): ~17952 levels ~80000 states ~190456 transitions
pnml2lts-mc( 2/ 4): ~36032 levels ~160000 states ~381508 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~959860 transitions
ltl formula name BugTracking-PT-q3m032-LTLFireability-09
ltl formula formula --ltl=/tmp/783/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.160 real 1.210 user 1.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27371 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 288.0 B/state, compr.: 9.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-10
ltl formula formula --ltl=/tmp/783/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.130 real 1.190 user 0.960 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27403 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 148
pnml2lts-mc( 0/ 4): unique transitions count: 1046
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 185
pnml2lts-mc( 0/ 4): - cum. max stack depth: 185
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 185 states 1194 transitions, fanout: 6.454
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.140 sec minimum, 0.143 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1233, Transitions per second: 7960
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 41.8 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-11
ltl formula formula --ltl=/tmp/783/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.320 real 1.000 user 0.960 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27380 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 177
pnml2lts-mc( 0/ 4): unique transitions count: 563
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 182
pnml2lts-mc( 0/ 4): - cum. max stack depth: 182
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 182 states 579 transitions, fanout: 3.181
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1300, Transitions per second: 4136
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 48.6 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-12
ltl formula formula --ltl=/tmp/783/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.420 real 1.050 user 0.970 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27383 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 335
pnml2lts-mc( 0/ 4): unique states count: 427
pnml2lts-mc( 0/ 4): unique transitions count: 771
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 7
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 436
pnml2lts-mc( 0/ 4): - cum. max stack depth: 98
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 436 states 811 transitions, fanout: 1.860
pnml2lts-mc( 0/ 4): Total exploration time 0.320 sec (0.320 sec minimum, 0.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1362, Transitions per second: 2534
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 50.6 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-13
ltl formula formula --ltl=/tmp/783/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.430 real 0.970 user 1.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27374 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2006 levels ~10000 states ~14820 transitions
pnml2lts-mc( 3/ 4): ~4006 levels ~20000 states ~29320 transitions
pnml2lts-mc( 3/ 4): ~8006 levels ~40000 states ~58320 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~239984 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~479980 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~959984 transitions
ltl formula name BugTracking-PT-q3m032-LTLFireability-14
ltl formula formula --ltl=/tmp/783/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.130 real 1.060 user 0.850 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27371 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 58
pnml2lts-mc( 0/ 4): unique transitions count: 140
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 73
pnml2lts-mc( 0/ 4): - cum. max stack depth: 73
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 73 states 185 transitions, fanout: 2.534
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1043, Transitions per second: 2643
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 71.9 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q3m032-LTLFireability-15
ltl formula formula --ltl=/tmp/783/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.220 real 1.320 user 0.990 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/783/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/783/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/783/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/783/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27375 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 72
pnml2lts-mc( 0/ 4): unique transitions count: 182
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 80
pnml2lts-mc( 0/ 4): - cum. max stack depth: 80
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 80 states 205 transitions, fanout: 2.562
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1143, Transitions per second: 2929
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 68.5 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)

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-q3m032"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BugTracking-PT-q3m032, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399300356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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