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-171620399500412.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-q8m016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500412
=====================================================================

--------------------
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 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m016-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717224272643

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-q8m016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:44:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:44:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:44:34] [INFO ] Load time of PNML (sax parser for PT used): 797 ms
[2024-06-01 06:44:34] [INFO ] Transformed 754 places.
[2024-06-01 06:44:35] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:44:35] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1035 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 105 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m016-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 89 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:44:35] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:44:35] [INFO ] Computed 8 invariants in 45 ms
[2024-06-01 06:44:36] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-06-01 06:44:36] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:44:36] [INFO ] Invariant cache hit.
[2024-06-01 06:44:37] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:44:41] [INFO ] Implicit Places using invariants and state equation in 4736 ms returned []
Implicit Place search using SMT with State Equation took 5432 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:44:41] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:44:41] [INFO ] Invariant cache hit.
[2024-06-01 06:44:41] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 19 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 1 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 11 constraints, problems are : Problem set: 0 solved, 3869 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3869 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 3/11 constraints. Problems are: Problem set: 40 solved, 3829 unsolved
[2024-06-01 06:46:21] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD814 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 12 constraints, problems are : Problem set: 45 solved, 3824 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 4/4 constraints]
After SMT, in 105743ms problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 45 dead transitions in 105888ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3826/3904 transitions.
Reduce places removed 10 places and 334 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 267 transition count 3492
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 15 place count 262 transition count 3340
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 260 transition count 3284
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 259 transition count 3252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 258 transition count 3227
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 258 transition count 3227
Deduced a syphon composed of 1 places in 6 ms
Applied a total of 20 rules in 53 ms. Remains 258 /277 variables (removed 19) and now considering 3227/3826 (removed 599) transitions.
[2024-06-01 06:46:27] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
// Phase 1: matrix 3100 rows 258 cols
[2024-06-01 06:46:27] [INFO ] Computed 9 invariants in 30 ms
[2024-06-01 06:46:27] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-06-01 06:46:27] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-06-01 06:46:27] [INFO ] Invariant cache hit.
[2024-06-01 06:46:28] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-06-01 06:46:29] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 258/280 places, 3227/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113681 ms. Remains : 258/280 places, 3227/3904 transitions.
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Support contains 5 out of 257 places after structural reductions.
FORMULA BugTracking-PT-q8m016-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:46:29] [INFO ] Flatten gal took : 256 ms
[2024-06-01 06:46:29] [INFO ] Flatten gal took : 156 ms
[2024-06-01 06:46:30] [INFO ] Input system was already deterministic with 3227 transitions.
RANDOM walk for 40014 steps (131 resets) in 2076 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (26 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 128847 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 128847 steps, saw 68443 distinct states, run finished after 3005 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 06:46:33] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
// Phase 1: matrix 3100 rows 257 cols
[2024-06-01 06:46:33] [INFO ] Computed 8 invariants in 14 ms
[2024-06-01 06:46:33] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 894/929 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/929 variables, 62/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/929 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1598/2527 variables, 71/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2527 variables, 119/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2527 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/2535 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2535 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 766/3301 variables, 120/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3301 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3301 variables, 64/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3301 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3303 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3303 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3303 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 53/3356 variables, 28/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3356 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3356 variables, 6/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3356 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/3357 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3357 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/3357 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3357/3357 variables, and 516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 257/257 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 894/929 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/929 variables, 62/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/929 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1598/2527 variables, 71/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2527 variables, 119/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2527 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2527 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/2535 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2535 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 766/3301 variables, 120/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3301 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3301 variables, 64/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3301 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3301 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3303 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3303 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:46:37] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3303 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3303 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 53/3356 variables, 28/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3356 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3356 variables, 6/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3356 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/3357 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3357 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/3357 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3357/3357 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3857 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 257/257 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 5453ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 923 ms.
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 3227/3227 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 256 transition count 3229
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 256 transition count 3222
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 249 transition count 3222
Applied a total of 16 rules in 310 ms. Remains 249 /257 variables (removed 8) and now considering 3222/3227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 249/257 places, 3222/3227 transitions.
RANDOM walk for 40019 steps (8 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 126554 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 126554 steps, saw 45938 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 06:46:43] [INFO ] Flow matrix only has 3092 transitions (discarded 130 similar events)
// Phase 1: matrix 3092 rows 249 cols
[2024-06-01 06:46:43] [INFO ] Computed 8 invariants in 29 ms
[2024-06-01 06:46:43] [INFO ] State equation strengthened by 252 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 894/929 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/929 variables, 62/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/929 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1604/2533 variables, 70/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2533 variables, 126/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2533 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/2538 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2538 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2538 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 753/3291 variables, 116/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3291 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3291 variables, 58/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3291 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 50/3341 variables, 27/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3341 variables, 6/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1339 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 894/929 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/929 variables, 62/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/929 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1604/2533 variables, 70/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2533 variables, 126/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2533 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2533 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/2538 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2538 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2538 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 753/3291 variables, 116/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3291 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3291 variables, 58/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3291 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 8 places in 473 ms of which 2 ms to minimize.
[2024-06-01 06:46:48] [INFO ] Deduced a trap composed of 18 places in 475 ms of which 2 ms to minimize.
[2024-06-01 06:46:49] [INFO ] Deduced a trap composed of 62 places in 468 ms of which 2 ms to minimize.
[2024-06-01 06:46:49] [INFO ] Deduced a trap composed of 63 places in 412 ms of which 2 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 60 places in 383 ms of which 2 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 62 places in 353 ms of which 2 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:46:51] [INFO ] Deduced a trap composed of 51 places in 356 ms of which 1 ms to minimize.
[2024-06-01 06:46:51] [INFO ] Deduced a trap composed of 16 places in 329 ms of which 1 ms to minimize.
[2024-06-01 06:46:52] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 2 ms to minimize.
[2024-06-01 06:46:52] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 1 ms to minimize.
[2024-06-01 06:46:53] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3291 variables, 13/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3291 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 50/3341 variables, 27/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3341 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3341 variables, 6/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3341 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/3341 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 524 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9453 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 10873ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3213 ms.
Support contains 5 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3222/3222 transitions.
Applied a total of 0 rules in 56 ms. Remains 249 /249 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 249/249 places, 3222/3222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3222/3222 transitions.
Applied a total of 0 rules in 51 ms. Remains 249 /249 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
[2024-06-01 06:46:58] [INFO ] Flow matrix only has 3092 transitions (discarded 130 similar events)
[2024-06-01 06:46:58] [INFO ] Invariant cache hit.
[2024-06-01 06:46:58] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-01 06:46:58] [INFO ] Flow matrix only has 3092 transitions (discarded 130 similar events)
[2024-06-01 06:46:58] [INFO ] Invariant cache hit.
[2024-06-01 06:46:58] [INFO ] State equation strengthened by 252 read => feed constraints.
[2024-06-01 06:47:00] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
[2024-06-01 06:47:00] [INFO ] Redundant transitions in 214 ms returned []
Running 3221 sub problems to find dead transitions.
[2024-06-01 06:47:00] [INFO ] Flow matrix only has 3092 transitions (discarded 130 similar events)
[2024-06-01 06:47:00] [INFO ] Invariant cache hit.
[2024-06-01 06:47:00] [INFO ] State equation strengthened by 252 read => feed constraints.
FORMULA BugTracking-PT-q8m016-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m016-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m016-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m016-LTLFireability-03
FORMULA BugTracking-PT-q8m016-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m016-LTLFireability-05
FORMULA BugTracking-PT-q8m016-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m016-LTLFireability-07
FORMULA BugTracking-PT-q8m016-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m016-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m016-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m016-LTLFireability-11
FORMULA BugTracking-PT-q8m016-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m016-LTLFireability-13
FORMULA BugTracking-PT-q8m016-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m016-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717225651563

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BugTracking-PT-q8m016-LTLFireability-00
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.910 real 1.340 user 1.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_0_
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 27373 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 ~17!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 33
pnml2lts-mc( 0/ 4): unique transitions count: 91
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: 37
pnml2lts-mc( 0/ 4): - cum. max stack depth: 37
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 37 states 111 transitions, fanout: 3.000
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.040 sec minimum, 0.045 sec on average)
pnml2lts-mc( 0/ 4): States per second: 740, Transitions per second: 2220
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.3 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-q8m016-LTLFireability-01
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.790 real 1.360 user 1.610 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27378 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 ~17!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 64
pnml2lts-mc( 0/ 4): unique transitions count: 213
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: 68
pnml2lts-mc( 0/ 4): - cum. max stack depth: 68
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 68 states 232 transitions, fanout: 3.412
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.070 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 756, Transitions per second: 2578
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, 62.9 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-q8m016-LTLFireability-02
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 7.230 real 1.460 user 1.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/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 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 ~17!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 63
pnml2lts-mc( 0/ 4): unique transitions count: 192
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: 71
pnml2lts-mc( 0/ 4): - cum. max stack depth: 71
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 71 states 212 transitions, fanout: 2.986
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.060 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 888, Transitions per second: 2650
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, 45.7 B/state, compr.: 1.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-q8m016-LTLFireability-03
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 7.140 real 1.420 user 1.410 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_3_
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 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): ~2131 levels ~10000 states ~20092 transitions
pnml2lts-mc( 3/ 4): ~4320 levels ~20000 states ~40456 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~163592 transitions
pnml2lts-mc( 3/ 4): ~17431 levels ~80000 states ~162356 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~654496 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~1309044 transitions
ltl formula name BugTracking-PT-q8m016-LTLFireability-04
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.850 real 1.230 user 1.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_4_
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 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( 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: 14
pnml2lts-mc( 0/ 4): unique states count: 14
pnml2lts-mc( 0/ 4): unique transitions count: 18
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 26
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26 states 46 transitions, fanout: 1.769
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.022 sec on average)
pnml2lts-mc( 0/ 4): States per second: 867, Transitions per second: 1533
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, 92.0 B/state, compr.: 3.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-q8m016-LTLFireability-05
ltl formula formula --ltl=/tmp/634/ltl_5_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.810 real 1.330 user 1.170 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 753 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): ~114 levels ~10000 states ~17684 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~46700 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~93360 transitions
pnml2lts-mc( 0/ 4): ~327 levels ~80000 states ~174176 transitions
pnml2lts-mc( 0/ 4): ~540 levels ~160000 states ~356712 transitions
pnml2lts-mc( 0/ 4): ~1037 levels ~320000 states ~712792 transitions
ltl formula name BugTracking-PT-q8m016-LTLFireability-06
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.690 real 1.400 user 1.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 8 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 27394 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 ~17!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 78
pnml2lts-mc( 0/ 4): unique transitions count: 243
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: 98
pnml2lts-mc( 0/ 4): - cum. max stack depth: 98
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 98 states 293 transitions, fanout: 2.990
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1225, Transitions per second: 3662
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, 46.0 B/state, compr.: 1.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-q8m016-LTLFireability-07
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.710 real 1.350 user 1.190 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_7_
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( 0/ 4): ~2500 levels ~10000 states ~32656 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~65384 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~130836 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~261748 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~523564 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~1047200 transitions
ltl formula name BugTracking-PT-q8m016-LTLFireability-08
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.740 real 1.310 user 1.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_8_
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.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
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-q8m016-LTLFireability-09
ltl formula formula --ltl=/tmp/634/ltl_9_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.690 real 1.290 user 1.180 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/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 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 ~17!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 27
pnml2lts-mc( 0/ 4): unique transitions count: 63
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: 37
pnml2lts-mc( 0/ 4): - cum. max stack depth: 37
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 37 states 91 transitions, fanout: 2.459
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.040 sec minimum, 0.042 sec on average)
pnml2lts-mc( 0/ 4): States per second: 740, Transitions per second: 1820
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, 70.9 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-q8m016-LTLFireability-10
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.710 real 1.310 user 1.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_10_
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 27379 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 ~17!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 31
pnml2lts-mc( 0/ 4): unique transitions count: 78
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: 42
pnml2lts-mc( 0/ 4): - cum. max stack depth: 42
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 42 states 110 transitions, fanout: 2.619
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1050, Transitions per second: 2750
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, 69.1 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-q8m016-LTLFireability-11
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.790 real 1.330 user 1.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_11_
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( 0/ 4): ~2500 levels ~10000 states ~30000 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~60000 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~120000 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~240000 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~480000 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~960000 transitions
ltl formula name BugTracking-PT-q8m016-LTLFireability-12
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.760 real 1.280 user 1.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_12_
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( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~17!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 33
pnml2lts-mc( 0/ 4): unique transitions count: 83
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: 38
pnml2lts-mc( 0/ 4): - cum. max stack depth: 38
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 38 states 98 transitions, fanout: 2.579
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 760, Transitions per second: 1960
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, 66.9 B/state, compr.: 2.2%
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-q8m016-LTLFireability-13
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.850 real 1.240 user 1.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/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( 0/ 4): ~2500 levels ~10000 states ~24976 transitions
pnml2lts-mc( 1/ 4): ~84 levels ~20000 states ~43372 transitions
pnml2lts-mc( 1/ 4): ~84 levels ~40000 states ~87944 transitions
pnml2lts-mc( 3/ 4): ~12497 levels ~80000 states ~212424 transitions
pnml2lts-mc( 3/ 4): ~12753 levels ~160000 states ~393948 transitions
pnml2lts-mc( 3/ 4): ~13328 levels ~320000 states ~752456 transitions
ltl formula name BugTracking-PT-q8m016-LTLFireability-14
ltl formula formula --ltl=/tmp/634/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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.670 real 1.210 user 1.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27381 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 ~17!
pnml2lts-mc( 1/ 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: 442
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: 97
pnml2lts-mc( 0/ 4): - cum. max stack depth: 97
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 97 states 520 transitions, fanout: 5.361
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1078, Transitions per second: 5778
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, 55.7 B/state, compr.: 1.8%
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-q8m016-LTLFireability-15
ltl formula formula --ltl=/tmp/634/ltl_15_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
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-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.670 real 1.420 user 1.170 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/634/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/634/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/634/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/634/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27407 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 ~17!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 27
pnml2lts-mc( 0/ 4): unique transitions count: 63
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: 37
pnml2lts-mc( 0/ 4): - cum. max stack depth: 37
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 37 states 93 transitions, fanout: 2.514
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 925, Transitions per second: 2325
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, 74.8 B/state, compr.: 2.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)

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-q8m016"
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-q8m016, 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-171620399500412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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