Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r488-tall-171631133000604.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DoubleLock-PT-p1s3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133000604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 8.2K 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 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 DoubleLock-PT-p1s3-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717201429200

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:23:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:23:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:23:50] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2024-06-01 00:23:50] [INFO ] Transformed 570 places.
[2024-06-01 00:23:50] [INFO ] Transformed 7568 transitions.
[2024-06-01 00:23:50] [INFO ] Parsed PT model containing 570 places and 7568 transitions and 30656 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 132 places in 35 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s3-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p1s3-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 7312/7312 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 434 transition count 7312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 433 transition count 7184
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 433 transition count 7184
Applied a total of 6 rules in 141 ms. Remains 433 /438 variables (removed 5) and now considering 7184/7312 (removed 128) transitions.
[2024-06-01 00:23:51] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2024-06-01 00:23:51] [INFO ] Computed 2 invariants in 85 ms
[2024-06-01 00:23:51] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-06-01 00:23:51] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2024-06-01 00:23:51] [INFO ] Invariant cache hit.
[2024-06-01 00:23:52] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:24:23] [INFO ] Performed 63/433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:24:55] [INFO ] Performed 422/433 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-06-01 00:25:02] [INFO ] Implicit Places using invariants and state equation in 70536 ms returned []
Implicit Place search using SMT with State Equation took 71250 ms to find 0 implicit places.
Running 7182 sub problems to find dead transitions.
[2024-06-01 00:25:02] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2024-06-01 00:25:02] [INFO ] Invariant cache hit.
[2024-06-01 00:25:02] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7182 unsolved
SMT process timed out in 60025ms, After SMT, problems are : Problem set: 0 solved, 7182 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 433/438 places, 7184/7312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131562 ms. Remains : 433/438 places, 7184/7312 transitions.
Support contains 43 out of 433 places after structural reductions.
[2024-06-01 00:26:03] [INFO ] Flatten gal took : 374 ms
[2024-06-01 00:26:03] [INFO ] Flatten gal took : 232 ms
[2024-06-01 00:26:03] [INFO ] Input system was already deterministic with 7184 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40010 steps (376 resets) in 1908 ms. (20 steps per ms) remains 17/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 11/11 properties
[2024-06-01 00:26:04] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2024-06-01 00:26:04] [INFO ] Invariant cache hit.
[2024-06-01 00:26:04] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 139/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4358/4531 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/4531 variables, 39/214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4531 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 8 (OVERLAPS) 745/5276 variables, 260/474 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5276 variables, 361/835 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5276/5276 variables, and 835 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/31 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 141/172 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4353/4525 variables, 172/174 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4525 variables, 36/210 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4525 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5276/5276 variables, and 471 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 36/400 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 10142ms problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 433 transition count 7060
Applied a total of 124 rules in 370 ms. Remains 433 /433 variables (removed 0) and now considering 7060/7184 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 433/433 places, 7060/7184 transitions.
RANDOM walk for 40008 steps (377 resets) in 317 ms. (125 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (53 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (57 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (52 resets) in 90 ms. (439 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (55 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (62 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (58 resets) in 83 ms. (476 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (53 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
[2024-06-01 00:26:15] [INFO ] Flow matrix only has 4719 transitions (discarded 2341 similar events)
// Phase 1: matrix 4719 rows 433 cols
[2024-06-01 00:26:15] [INFO ] Computed 2 invariants in 44 ms
[2024-06-01 00:26:15] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 141/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2771/2922 variables, 151/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2922 variables, 12/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2922 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2104/5026 variables, 156/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5026 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5026 variables, 388/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5026 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 126/5152 variables, 126/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5152 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/5152 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5152/5152 variables, and 835 constraints, problems are : Problem set: 0 solved, 5 unsolved in 33526 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 141/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2771/2922 variables, 151/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2922 variables, 12/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2922 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2104/5026 variables, 156/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5026 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5026 variables, 388/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5026 variables, 5/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5026 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5152/5152 variables, and 840 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 78667ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7060/7060 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 433 transition count 7057
Applied a total of 3 rules in 196 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7060 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 433/433 places, 7057/7060 transitions.
RANDOM walk for 40000 steps (365 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (56 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (55 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (57 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (60 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (54 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 118613 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 5
Probabilistic random walk after 118613 steps, saw 92747 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 00:27:37] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
// Phase 1: matrix 4716 rows 433 cols
[2024-06-01 00:27:37] [INFO ] Computed 2 invariants in 33 ms
[2024-06-01 00:27:37] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 141/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2771/2922 variables, 151/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2922 variables, 12/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2922 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2101/5023 variables, 156/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5023 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5023 variables, 388/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5023 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 126/5149 variables, 126/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5149 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/5149 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5149/5149 variables, and 835 constraints, problems are : Problem set: 0 solved, 5 unsolved in 29849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 141/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2771/2922 variables, 151/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2922 variables, 12/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2922 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2101/5023 variables, 156/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5023 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5023 variables, 388/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5023 variables, 5/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5023 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5149/5149 variables, and 840 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 104973ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7057/7057 transitions.
Applied a total of 0 rules in 173 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7057 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 433/433 places, 7057/7057 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7057/7057 transitions.
Applied a total of 0 rules in 227 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7057 (removed 0) transitions.
[2024-06-01 00:29:22] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2024-06-01 00:29:22] [INFO ] Invariant cache hit.
[2024-06-01 00:29:23] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-06-01 00:29:23] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2024-06-01 00:29:23] [INFO ] Invariant cache hit.
[2024-06-01 00:29:24] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:29:56] [INFO ] Performed 74/433 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-06-01 00:30:26] [INFO ] Performed 316/433 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-06-01 00:30:56] [INFO ] Implicit Places using invariants and state equation in 92955 ms returned []
Implicit Place search using SMT with State Equation took 93443 ms to find 0 implicit places.
[2024-06-01 00:30:57] [INFO ] Redundant transitions in 728 ms returned []
Running 7055 sub problems to find dead transitions.
[2024-06-01 00:30:57] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2024-06-01 00:30:57] [INFO ] Invariant cache hit.
[2024-06-01 00:30:57] [INFO ] State equation strengthened by 400 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7055 unsolved
SMT process timed out in 59846ms, After SMT, problems are : Problem set: 0 solved, 7055 unsolved
Search for dead transitions found 0 dead transitions in 59908ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154358 ms. Remains : 433/433 places, 7057/7057 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 10 stabilizing places and 2144 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(X(G((X(F(p0))||(F(p2)&&p1))))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Applied a total of 0 rules in 19 ms. Remains 433 /433 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2024-06-01 00:31:57] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2024-06-01 00:31:57] [INFO ] Computed 2 invariants in 41 ms
[2024-06-01 00:31:57] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-06-01 00:31:57] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2024-06-01 00:31:57] [INFO ] Invariant cache hit.
[2024-06-01 00:31:58] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:32:29] [INFO ] Performed 64/433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:33:00] [INFO ] Performed 410/433 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-06-01 00:33:13] [INFO ] Implicit Places using invariants and state equation in 75479 ms returned []
Implicit Place search using SMT with State Equation took 75968 ms to find 0 implicit places.
Running 7182 sub problems to find dead transitions.
[2024-06-01 00:33:13] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2024-06-01 00:33:13] [INFO ] Invariant cache hit.
[2024-06-01 00:33:13] [INFO ] State equation strengthened by 400 read => feed constraints.
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-00
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-01
FORMULA DoubleLock-PT-p1s3-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s3-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s3-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s3-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-06
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-07
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-08
FORMULA DoubleLock-PT-p1s3-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-10
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-11
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-12
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-13
FORMULA DoubleLock-PT-p1s3-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s3-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717202631782

--------------------
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 DoubleLock-PT-p1s3-LTLFireability-00
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.200 user 0.210 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_0_
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 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7575 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): ~71 levels ~10000 states ~43516 transitions
pnml2lts-mc( 0/ 4): ~71 levels ~20000 states ~88044 transitions
pnml2lts-mc( 0/ 4): ~71 levels ~40000 states ~206284 transitions
pnml2lts-mc( 0/ 4): ~71 levels ~80000 states ~430684 transitions
pnml2lts-mc( 0/ 4): ~71 levels ~160000 states ~920924 transitions
pnml2lts-mc( 3/ 4): ~21249 levels ~320000 states ~810532 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 427906
pnml2lts-mc( 0/ 4): unique states count: 620928
pnml2lts-mc( 0/ 4): unique transitions count: 2109898
pnml2lts-mc( 0/ 4): - self-loop count: 92198
pnml2lts-mc( 0/ 4): - claim dead count: 341160
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 620944
pnml2lts-mc( 0/ 4): - cum. max stack depth: 193037
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 620944 states 2109967 transitions, fanout: 3.398
pnml2lts-mc( 0/ 4): Total exploration time 80.270 sec (80.210 sec minimum, 80.237 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7736, Transitions per second: 26286
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 76.8MB, 48.0 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 76.8MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-01
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.210 user 0.180 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/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 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7571 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): ~1519 levels ~10000 states ~26936 transitions
pnml2lts-mc( 3/ 4): ~2977 levels ~20000 states ~52780 transitions
pnml2lts-mc( 3/ 4): ~5893 levels ~40000 states ~104436 transitions
pnml2lts-mc( 3/ 4): ~11727 levels ~80000 states ~207780 transitions
pnml2lts-mc( 3/ 4): ~23393 levels ~160000 states ~414436 transitions
pnml2lts-mc( 3/ 4): ~46727 levels ~320000 states ~827780 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 110242
pnml2lts-mc( 0/ 4): unique states count: 438858
pnml2lts-mc( 0/ 4): unique transitions count: 1576734
pnml2lts-mc( 0/ 4): - self-loop count: 110242
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 438866
pnml2lts-mc( 0/ 4): - cum. max stack depth: 328624
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 438866 states 1576752 transitions, fanout: 3.593
pnml2lts-mc( 0/ 4): Total exploration time 56.830 sec (56.760 sec minimum, 56.782 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7722, Transitions per second: 27745
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 75.2MB, 53.8 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 75.2MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-02
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.230 user 0.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_2_
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 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7571 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 ~71!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 279
pnml2lts-mc( 0/ 4): unique transitions count: 1272
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: 286
pnml2lts-mc( 0/ 4): - cum. max stack depth: 286
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 286 states 1300 transitions, fanout: 4.545
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: 5720, Transitions per second: 26000
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.2 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-03
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.230 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7575 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 ~63!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 245
pnml2lts-mc( 0/ 4): unique transitions count: 1421
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: 252
pnml2lts-mc( 0/ 4): - cum. max stack depth: 252
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 252 states 1447 transitions, fanout: 5.742
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: 5040, Transitions per second: 28940
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 45.3 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-04
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.200 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7583 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 ~52!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 205
pnml2lts-mc( 0/ 4): unique transitions count: 1173
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: 210
pnml2lts-mc( 0/ 4): - cum. max stack depth: 210
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 210 states 1191 transitions, fanout: 5.671
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: 5250, Transitions per second: 29775
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.2 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-05
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.580 real 0.200 user 0.210 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7572 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 ~71!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 253
pnml2lts-mc( 0/ 4): unique transitions count: 1184
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: 260
pnml2lts-mc( 0/ 4): - cum. max stack depth: 260
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 260 states 1210 transitions, fanout: 4.654
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: 6500, Transitions per second: 30250
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, 44.4 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-06
ltl formula formula --ltl=/tmp/591/ltl_6_
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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.190 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_6_
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 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7575 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): ~71 levels ~10000 states ~51404 transitions
pnml2lts-mc( 1/ 4): ~71 levels ~20000 states ~110092 transitions
pnml2lts-mc( 1/ 4): ~71 levels ~40000 states ~215956 transitions
pnml2lts-mc( 1/ 4): ~71 levels ~80000 states ~498340 transitions
pnml2lts-mc( 2/ 4): ~71 levels ~160000 states ~1078164 transitions
pnml2lts-mc( 2/ 4): ~23282 levels ~320000 states ~1804908 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 112788
pnml2lts-mc( 0/ 4): unique states count: 505598
pnml2lts-mc( 0/ 4): unique transitions count: 1969698
pnml2lts-mc( 0/ 4): - self-loop count: 35315
pnml2lts-mc( 0/ 4): - claim dead count: 433192
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 505729
pnml2lts-mc( 0/ 4): - cum. max stack depth: 392815
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 505729 states 1970374 transitions, fanout: 3.896
pnml2lts-mc( 0/ 4): Total exploration time 65.630 sec (65.580 sec minimum, 65.607 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7706, Transitions per second: 30022
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 75.5MB, 52.7 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 75.5MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-07
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.230 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/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 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7572 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): ~1332 levels ~10000 states ~30844 transitions
pnml2lts-mc( 2/ 4): ~3074 levels ~20000 states ~55824 transitions
pnml2lts-mc( 2/ 4): ~5926 levels ~40000 states ~108480 transitions
pnml2lts-mc( 2/ 4): ~11646 levels ~80000 states ~213872 transitions
pnml2lts-mc( 2/ 4): ~23070 levels ~160000 states ~424496 transitions
pnml2lts-mc( 2/ 4): ~45926 levels ~320000 states ~845980 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 95447
pnml2lts-mc( 0/ 4): unique states count: 384587
pnml2lts-mc( 0/ 4): unique transitions count: 1501692
pnml2lts-mc( 0/ 4): - self-loop count: 95447
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 384605
pnml2lts-mc( 0/ 4): - cum. max stack depth: 289158
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 384605 states 1501755 transitions, fanout: 3.905
pnml2lts-mc( 0/ 4): Total exploration time 52.310 sec (52.260 sec minimum, 52.272 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7352, Transitions per second: 28709
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 74.7MB, 55.7 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 74.7MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-08
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.220 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_8_
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 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7572 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): ~71 levels ~10000 states ~44164 transitions
pnml2lts-mc( 1/ 4): ~71 levels ~20000 states ~97924 transitions
pnml2lts-mc( 1/ 4): ~71 levels ~40000 states ~225508 transitions
pnml2lts-mc( 1/ 4): ~71 levels ~80000 states ~445732 transitions
pnml2lts-mc( 1/ 4): ~71 levels ~160000 states ~993892 transitions
pnml2lts-mc( 1/ 4): ~1718 levels ~320000 states ~2070040 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 155688
pnml2lts-mc( 0/ 4): unique states count: 514631
pnml2lts-mc( 0/ 4): unique transitions count: 2057382
pnml2lts-mc( 0/ 4): - self-loop count: 78215
pnml2lts-mc( 0/ 4): - claim dead count: 433254
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 514645
pnml2lts-mc( 0/ 4): - cum. max stack depth: 358957
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 514645 states 2057412 transitions, fanout: 3.998
pnml2lts-mc( 0/ 4): Total exploration time 76.340 sec (76.290 sec minimum, 76.303 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6741, Transitions per second: 26951
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 75.8MB, 51.4 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 75.8MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-09
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.200 user 0.180 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7574 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 ~71!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 286
pnml2lts-mc( 0/ 4): unique transitions count: 1531
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: 291
pnml2lts-mc( 0/ 4): - cum. max stack depth: 291
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 291 states 1555 transitions, fanout: 5.344
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: 5820, Transitions per second: 31100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 45.6 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-10
ltl formula formula --ltl=/tmp/591/ltl_10_
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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.220 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_10_
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 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7575 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 ~34048 transitions
pnml2lts-mc( 2/ 4): ~4590 levels ~20000 states ~66124 transitions
pnml2lts-mc( 2/ 4): ~9206 levels ~40000 states ~131508 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~265936 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~530936 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~1060936 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31192
pnml2lts-mc( 0/ 4): unique states count: 381849
pnml2lts-mc( 0/ 4): unique transitions count: 1655141
pnml2lts-mc( 0/ 4): - self-loop count: 31192
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 381856
pnml2lts-mc( 0/ 4): - cum. max stack depth: 350664
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 381856 states 1655153 transitions, fanout: 4.334
pnml2lts-mc( 0/ 4): Total exploration time 49.910 sec (49.840 sec minimum, 49.875 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7651, Transitions per second: 33163
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 76.4MB, 49.3 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 76.4MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-11
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.190 user 0.210 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7572 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): ~1894 levels ~10000 states ~28804 transitions
pnml2lts-mc( 1/ 4): ~3769 levels ~20000 states ~57124 transitions
pnml2lts-mc( 1/ 4): ~7519 levels ~40000 states ~113804 transitions
pnml2lts-mc( 1/ 4): ~15019 levels ~80000 states ~227124 transitions
pnml2lts-mc( 1/ 4): ~30019 levels ~160000 states ~453804 transitions
pnml2lts-mc( 1/ 4): ~60019 levels ~320000 states ~907124 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 108813
pnml2lts-mc( 0/ 4): unique states count: 499327
pnml2lts-mc( 0/ 4): unique transitions count: 1643582
pnml2lts-mc( 0/ 4): - self-loop count: 108813
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 16
pnml2lts-mc( 0/ 4): - claim success count: 499335
pnml2lts-mc( 0/ 4): - cum. max stack depth: 390514
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 499335 states 1643598 transitions, fanout: 3.292
pnml2lts-mc( 0/ 4): Total exploration time 69.290 sec (69.250 sec minimum, 69.265 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7206, Transitions per second: 23721
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 75.7MB, 51.7 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 75.7MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-12
ltl formula formula --ltl=/tmp/591/ltl_12_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.190 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/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 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7573 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): ~2009 levels ~10000 states ~20612 transitions
pnml2lts-mc( 2/ 4): ~3998 levels ~20000 states ~40392 transitions
pnml2lts-mc( 2/ 4): ~7965 levels ~40000 states ~79532 transitions
pnml2lts-mc( 2/ 4): ~15913 levels ~80000 states ~158048 transitions
pnml2lts-mc( 2/ 4): ~31815 levels ~160000 states ~315180 transitions
pnml2lts-mc( 2/ 4): ~63597 levels ~320000 states ~629376 transitions
pnml2lts-mc( 2/ 4): ~127175 levels ~640000 states ~1257732 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 284728
pnml2lts-mc( 0/ 4): unique states count: 670770
pnml2lts-mc( 0/ 4): unique transitions count: 1770368
pnml2lts-mc( 0/ 4): - self-loop count: 284728
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1717
pnml2lts-mc( 0/ 4): - claim success count: 670783
pnml2lts-mc( 0/ 4): - cum. max stack depth: 383234
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 670783 states 1770407 transitions, fanout: 2.639
pnml2lts-mc( 0/ 4): Total exploration time 85.940 sec (85.870 sec minimum, 85.905 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7805, Transitions per second: 20600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 75.3MB, 53.4 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 75.3MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-13
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.230 user 0.160 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7576 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): ~1240 levels ~10000 states ~25264 transitions
pnml2lts-mc( 3/ 4): ~2178 levels ~20000 states ~49636 transitions
pnml2lts-mc( 3/ 4): ~4052 levels ~40000 states ~98388 transitions
pnml2lts-mc( 3/ 4): ~7802 levels ~80000 states ~195888 transitions
pnml2lts-mc( 3/ 4): ~15302 levels ~160000 states ~390888 transitions
pnml2lts-mc( 3/ 4): ~30302 levels ~320000 states ~780888 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 175941
pnml2lts-mc( 0/ 4): unique states count: 489856
pnml2lts-mc( 0/ 4): unique transitions count: 1580625
pnml2lts-mc( 0/ 4): - self-loop count: 175941
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 78
pnml2lts-mc( 0/ 4): - claim success count: 489864
pnml2lts-mc( 0/ 4): - cum. max stack depth: 313902
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 489864 states 1580640 transitions, fanout: 3.227
pnml2lts-mc( 0/ 4): Total exploration time 63.670 sec (63.640 sec minimum, 63.657 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7694, Transitions per second: 24826
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 74.7MB, 55.8 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 74.7MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-14
ltl formula formula --ltl=/tmp/591/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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.570 real 0.240 user 0.160 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7578 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 ~71!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 256
pnml2lts-mc( 0/ 4): unique transitions count: 1393
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: 263
pnml2lts-mc( 0/ 4): - cum. max stack depth: 263
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 263 states 1421 transitions, fanout: 5.403
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: 6575, Transitions per second: 35525
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 44.7 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-15
ltl formula formula --ltl=/tmp/591/ltl_15_
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 570 places, 7568 transitions and 30656 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.240 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/591/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/591/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/591/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/591/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7591 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 ~32!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 132
pnml2lts-mc( 0/ 4): unique transitions count: 701
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: 137
pnml2lts-mc( 0/ 4): - cum. max stack depth: 137
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 137 states 719 transitions, fanout: 5.248
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6850, Transitions per second: 35950
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, 44.4 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7819 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.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="DoubleLock-PT-p1s3"
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 DoubleLock-PT-p1s3, 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 r488-tall-171631133000604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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