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-171631133000596.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-p1s2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133000596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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-p1s2-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717201140205

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-p1s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:19:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:19:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:19:01] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2024-06-01 00:19:01] [INFO ] Transformed 570 places.
[2024-06-01 00:19:01] [INFO ] Transformed 7600 transitions.
[2024-06-01 00:19:01] [INFO ] Parsed PT model containing 570 places and 7600 transitions and 30784 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 132 places in 47 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s2-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 7344/7344 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 7344
Applied a total of 4 rules in 109 ms. Remains 434 /438 variables (removed 4) and now considering 7344/7344 (removed 0) transitions.
[2024-06-01 00:19:02] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
// Phase 1: matrix 5003 rows 434 cols
[2024-06-01 00:19:02] [INFO ] Computed 2 invariants in 86 ms
[2024-06-01 00:19:02] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-06-01 00:19:02] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2024-06-01 00:19:02] [INFO ] Invariant cache hit.
[2024-06-01 00:19:03] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:19:35] [INFO ] Performed 101/434 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:20:05] [INFO ] Performed 398/434 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:20:14] [INFO ] Implicit Places using invariants and state equation in 71579 ms returned []
Implicit Place search using SMT with State Equation took 72261 ms to find 0 implicit places.
Running 7342 sub problems to find dead transitions.
[2024-06-01 00:20:14] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2024-06-01 00:20:14] [INFO ] Invariant cache hit.
[2024-06-01 00:20:14] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7342 unsolved
SMT process timed out in 60252ms, After SMT, problems are : Problem set: 0 solved, 7342 unsolved
Search for dead transitions found 0 dead transitions in 60346ms
Starting structural reductions in LTL mode, iteration 1 : 434/438 places, 7344/7344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132778 ms. Remains : 434/438 places, 7344/7344 transitions.
Support contains 55 out of 434 places after structural reductions.
[2024-06-01 00:21:15] [INFO ] Flatten gal took : 380 ms
[2024-06-01 00:21:15] [INFO ] Flatten gal took : 220 ms
[2024-06-01 00:21:16] [INFO ] Input system was already deterministic with 7344 transitions.
RANDOM walk for 40007 steps (337 resets) in 1930 ms. (20 steps per ms) remains 22/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
[2024-06-01 00:21:17] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2024-06-01 00:21:17] [INFO ] Invariant cache hit.
[2024-06-01 00:21:17] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 10/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 134/183 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 4835/5018 variables, 183/185 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/5018 variables, 285/470 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5018 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5437/5437 variables, and 721 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 434/434 constraints, ReadFeed: 285/400 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 10/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 134/183 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 4835/5018 variables, 183/185 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5018 variables, 285/470 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5018 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5437/5437 variables, and 721 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 434/434 constraints, ReadFeed: 285/400 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 10209ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 434 transition count 7291
Applied a total of 53 rules in 320 ms. Remains 434 /434 variables (removed 0) and now considering 7291/7344 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 434/434 places, 7291/7344 transitions.
RANDOM walk for 40002 steps (347 resets) in 346 ms. (115 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 112866 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :1 out of 18
Probabilistic random walk after 112866 steps, saw 88321 distinct states, run finished after 3004 ms. (steps per millisecond=37 ) properties seen :1
[2024-06-01 00:21:30] [INFO ] Flow matrix only has 4950 transitions (discarded 2341 similar events)
// Phase 1: matrix 4950 rows 434 cols
[2024-06-01 00:21:30] [INFO ] Computed 2 invariants in 47 ms
[2024-06-01 00:21:30] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 10/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 134/181 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 4832/5013 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/5013 variables, 283/466 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5013 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5384/5384 variables, and 719 constraints, problems are : Problem set: 0 solved, 17 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 434/434 constraints, ReadFeed: 283/400 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 10/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 134/181 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 4832/5013 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5013 variables, 283/466 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5013 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5384/5384 variables, and 719 constraints, problems are : Problem set: 0 solved, 17 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 434/434 constraints, ReadFeed: 283/400 constraints, PredecessorRefiner: 0/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 90234ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 7291/7291 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 7290
Applied a total of 1 rules in 180 ms. Remains 434 /434 variables (removed 0) and now considering 7290/7291 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 434/434 places, 7290/7291 transitions.
FORMULA DoubleLock-PT-p1s2-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 2176 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' '!(G(F(((!p0||F(!p0)) U (G((!p0||F(!p0)))||(((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))&&(!p0||F(!p0))))))))'
Support contains 2 out of 434 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 355 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-06-01 00:23:01] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2024-06-01 00:23:01] [INFO ] Computed 2 invariants in 37 ms
[2024-06-01 00:23:02] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-01 00:23:02] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:23:02] [INFO ] Invariant cache hit.
[2024-06-01 00:23:03] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:23:34] [INFO ] Performed 413/433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:23:46] [INFO ] Implicit Places using invariants and state equation in 44271 ms returned []
Implicit Place search using SMT with State Equation took 44730 ms to find 0 implicit places.
[2024-06-01 00:23:47] [INFO ] Redundant transitions in 696 ms returned []
Running 7214 sub problems to find dead transitions.
[2024-06-01 00:23:47] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:23:47] [INFO ] Invariant cache hit.
[2024-06-01 00:23:47] [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, 7214 unsolved
SMT process timed out in 60404ms, After SMT, problems are : Problem set: 0 solved, 7214 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106270 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 199 ms :[p0, p0]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-00
Product exploration explored 100000 steps with 1282 reset in 851 ms.
Product exploration explored 100000 steps with 1264 reset in 692 ms.
Computed a total of 10 stabilizing places and 2176 stable transitions
Computed a total of 10 stabilizing places and 2176 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
RANDOM walk for 40010 steps (354 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (52 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 175500 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 175500 steps, saw 135069 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 00:24:52] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:24:52] [INFO ] Invariant cache hit.
[2024-06-01 00:24:52] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 300/302 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4875/5177 variables, 300/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5177 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5177 variables, 400/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/5177 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/5181 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5181 variables, 4/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5181 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 127/5308 variables, 127/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5308 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/5308 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5308/5308 variables, and 835 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2236 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: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 300/302 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5177/5308 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1445 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 302/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3733ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 433 transition count 7088
Applied a total of 128 rules in 225 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7216 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 433/433 places, 7088/7216 transitions.
RANDOM walk for 40000 steps (343 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30244 steps (37 resets) in 57 ms. (521 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Support contains 2 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 160 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2024-06-01 00:24:57] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:24:57] [INFO ] Invariant cache hit.
[2024-06-01 00:24:57] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-06-01 00:24:57] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:24:57] [INFO ] Invariant cache hit.
[2024-06-01 00:24:58] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:25:29] [INFO ] Performed 413/433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:25:42] [INFO ] Implicit Places using invariants and state equation in 44286 ms returned []
Implicit Place search using SMT with State Equation took 44706 ms to find 0 implicit places.
[2024-06-01 00:25:42] [INFO ] Redundant transitions in 653 ms returned []
Running 7214 sub problems to find dead transitions.
[2024-06-01 00:25:42] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:25:42] [INFO ] Invariant cache hit.
[2024-06-01 00:25:42] [INFO ] State equation strengthened by 400 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7214 unsolved
SMT process timed out in 60179ms, After SMT, problems are : Problem set: 0 solved, 7214 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105778 ms. Remains : 433/433 places, 7216/7216 transitions.
Computed a total of 10 stabilizing places and 2176 stable transitions
Computed a total of 10 stabilizing places and 2176 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
RANDOM walk for 40020 steps (348 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (48 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 176012 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 176012 steps, saw 135449 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 00:26:46] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:26:46] [INFO ] Invariant cache hit.
[2024-06-01 00:26:46] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 300/302 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4875/5177 variables, 300/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5177 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5177/5308 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1514 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 302/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 300/302 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5177/5308 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 302/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3031ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 433 transition count 7088
Applied a total of 128 rules in 161 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7216 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 433/433 places, 7088/7216 transitions.
RANDOM walk for 33976 steps (297 resets) in 151 ms. (223 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Product exploration explored 100000 steps with 1274 reset in 687 ms.
Product exploration explored 100000 steps with 1278 reset in 702 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 149 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2024-06-01 00:26:51] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:26:51] [INFO ] Invariant cache hit.
[2024-06-01 00:26:51] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-06-01 00:26:51] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:26:51] [INFO ] Invariant cache hit.
[2024-06-01 00:26:52] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-06-01 00:27:23] [INFO ] Performed 359/433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:27:53] [INFO ] Performed 424/433 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:27:55] [INFO ] Implicit Places using invariants and state equation in 63728 ms returned []
Implicit Place search using SMT with State Equation took 64184 ms to find 0 implicit places.
[2024-06-01 00:27:56] [INFO ] Redundant transitions in 473 ms returned []
Running 7214 sub problems to find dead transitions.
[2024-06-01 00:27:56] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-06-01 00:27:56] [INFO ] Invariant cache hit.
[2024-06-01 00:27:56] [INFO ] State equation strengthened by 400 read => feed constraints.
Could not compute solution for formula : DoubleLock-PT-p1s2-LTLFireability-00
FORMULA DoubleLock-PT-p1s2-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s2-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleLock-PT-p1s2-LTLFireability-03
FORMULA DoubleLock-PT-p1s2-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s2-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s2-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s2-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s2-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s2-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s2-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleLock-PT-p1s2-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleLock-PT-p1s2-LTLFireability-12
FORMULA DoubleLock-PT-p1s2-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleLock-PT-p1s2-LTLFireability-14
FORMULA DoubleLock-PT-p1s2-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717201969135

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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-p1s2-LTLFireability-00
ltl formula formula --ltl=/tmp/712/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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.220 user 0.190 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 438 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7603 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): ~1633 levels ~10000 states ~30100 transitions
pnml2lts-mc( 0/ 4): ~3224 levels ~20000 states ~59180 transitions
pnml2lts-mc( 0/ 4): ~6405 levels ~40000 states ~117364 transitions
pnml2lts-mc( 0/ 4): ~12769 levels ~80000 states ~233740 transitions
pnml2lts-mc( 0/ 4): ~25497 levels ~160000 states ~466468 transitions
pnml2lts-mc( 0/ 4): ~50951 levels ~320000 states ~931912 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 58906
pnml2lts-mc( 0/ 4): unique states count: 375640
pnml2lts-mc( 0/ 4): unique transitions count: 1633196
pnml2lts-mc( 0/ 4): - self-loop count: 58906
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 375646
pnml2lts-mc( 0/ 4): - cum. max stack depth: 316740
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 375646 states 1633209 transitions, fanout: 4.348
pnml2lts-mc( 0/ 4): Total exploration time 49.160 sec (49.090 sec minimum, 49.108 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7641, Transitions per second: 33222
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 76.0MB, 50.6 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7851 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 76.0MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s2-LTLFireability-01
ltl formula formula --ltl=/tmp/712/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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.240 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7618 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 ~83!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 303
pnml2lts-mc( 0/ 4): unique transitions count: 3086
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 309
pnml2lts-mc( 0/ 4): - cum. max stack depth: 309
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 309 states 3126 transitions, fanout: 10.117
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5150, Transitions per second: 52100
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, 38.7 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-02
ltl formula formula --ltl=/tmp/712/ltl_2_
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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.250 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7621 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 ~57!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 255
pnml2lts-mc( 0/ 4): unique transitions count: 1456
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: 264
pnml2lts-mc( 0/ 4): - cum. max stack depth: 264
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 264 states 1490 transitions, fanout: 5.644
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: 5280, Transitions per second: 29800
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, 43.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-03
ltl formula formula --ltl=/tmp/712/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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.580 real 0.220 user 0.190 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_3_
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 7606 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): ~1201 levels ~10000 states ~27264 transitions
pnml2lts-mc( 3/ 4): ~2305 levels ~20000 states ~54304 transitions
pnml2lts-mc( 3/ 4): ~4513 levels ~40000 states ~108320 transitions
pnml2lts-mc( 3/ 4): ~8929 levels ~80000 states ~216376 transitions
pnml2lts-mc( 3/ 4): ~17760 levels ~160000 states ~432472 transitions
pnml2lts-mc( 3/ 4): ~35423 levels ~320000 states ~864696 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 157762
pnml2lts-mc( 0/ 4): unique states count: 504223
pnml2lts-mc( 0/ 4): unique transitions count: 1642507
pnml2lts-mc( 0/ 4): - self-loop count: 157762
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 504253
pnml2lts-mc( 0/ 4): - cum. max stack depth: 346491
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 504253 states 1642593 transitions, fanout: 3.257
pnml2lts-mc( 0/ 4): Total exploration time 76.430 sec (76.370 sec minimum, 76.405 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6598, Transitions per second: 21491
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.3 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-04
ltl formula formula --ltl=/tmp/712/ltl_4_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 570 places, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.580 real 0.180 user 0.220 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_4_
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 7608 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 ~87!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 322
pnml2lts-mc( 0/ 4): unique transitions count: 1649
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: 327
pnml2lts-mc( 0/ 4): - cum. max stack depth: 327
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 327 states 1667 transitions, fanout: 5.098
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5450, Transitions per second: 27783
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 7851 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-p1s2-LTLFireability-05
ltl formula formula --ltl=/tmp/712/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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 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/712/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_5_
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 7613 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 ~32!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 109
pnml2lts-mc( 0/ 4): unique transitions count: 612
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: 116
pnml2lts-mc( 0/ 4): - cum. max stack depth: 116
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 116 states 644 transitions, fanout: 5.552
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: 5800, Transitions per second: 32200
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, 39.1 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-06
ltl formula formula --ltl=/tmp/712/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 570 places, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.570 real 0.210 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/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 7609 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 ~117!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 451
pnml2lts-mc( 0/ 4): unique transitions count: 2079
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: 460
pnml2lts-mc( 0/ 4): - cum. max stack depth: 460
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 460 states 2111 transitions, fanout: 4.589
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5750, Transitions per second: 26388
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, 48.2 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-07
ltl formula formula --ltl=/tmp/712/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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.570 real 0.210 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_7_
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 7610 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~57!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 227
pnml2lts-mc( 0/ 4): unique transitions count: 1231
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: 233
pnml2lts-mc( 0/ 4): - cum. max stack depth: 233
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 233 states 1253 transitions, fanout: 5.378
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: 5825, Transitions per second: 31325
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, 43.4 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-08
ltl formula formula --ltl=/tmp/712/ltl_8_
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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.230 user 0.180 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/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 7606 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 ~53!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 182
pnml2lts-mc( 0/ 4): unique transitions count: 875
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: 187
pnml2lts-mc( 0/ 4): - cum. max stack depth: 187
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 187 states 893 transitions, fanout: 4.775
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: 4675, Transitions per second: 22325
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.6 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-09
ltl formula formula --ltl=/tmp/712/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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.590 real 0.210 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_9_
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 7604 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 ~64!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 235
pnml2lts-mc( 0/ 4): unique transitions count: 1234
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: 240
pnml2lts-mc( 0/ 4): - cum. max stack depth: 240
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 240 states 1258 transitions, fanout: 5.242
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: 4800, Transitions per second: 25160
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.4 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-10
ltl formula formula --ltl=/tmp/712/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 570 places, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.570 real 0.210 user 0.200 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_10_
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 7608 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 ~78!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 319
pnml2lts-mc( 0/ 4): unique transitions count: 1471
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: 330
pnml2lts-mc( 0/ 4): - cum. max stack depth: 330
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 330 states 1517 transitions, fanout: 4.597
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5500, Transitions per second: 25283
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.9 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-11
ltl formula formula --ltl=/tmp/712/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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.200 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_11_
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 7605 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 ~88!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 372
pnml2lts-mc( 0/ 4): unique transitions count: 3394
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 378
pnml2lts-mc( 0/ 4): - cum. max stack depth: 378
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 378 states 3440 transitions, fanout: 9.101
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6300, Transitions per second: 57333
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.7 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-12
ltl formula formula --ltl=/tmp/712/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 570 places, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 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.190 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_12_
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 7604 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): ~1409 levels ~10000 states ~32460 transitions
pnml2lts-mc( 2/ 4): ~2481 levels ~20000 states ~58884 transitions
pnml2lts-mc( 2/ 4): ~4624 levels ~40000 states ~111748 transitions
pnml2lts-mc( 2/ 4): ~8909 levels ~80000 states ~217460 transitions
pnml2lts-mc( 2/ 4): ~17481 levels ~160000 states ~428884 transitions
pnml2lts-mc( 2/ 4): ~34624 levels ~320000 states ~851748 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 55155
pnml2lts-mc( 0/ 4): unique states count: 383477
pnml2lts-mc( 0/ 4): unique transitions count: 1669613
pnml2lts-mc( 0/ 4): - self-loop count: 55155
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 383492
pnml2lts-mc( 0/ 4): - cum. max stack depth: 328337
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 383492 states 1669661 transitions, fanout: 4.354
pnml2lts-mc( 0/ 4): Total exploration time 51.790 sec (51.770 sec minimum, 51.783 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7405, Transitions per second: 32239
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 76.3MB, 49.6 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7851 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 76.3MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s2-LTLFireability-13
ltl formula formula --ltl=/tmp/712/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, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 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( 1/ 4): LTL layer: formula: /tmp/712/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_13_
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 7606 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 ~51!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 201
pnml2lts-mc( 0/ 4): unique transitions count: 989
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: 206
pnml2lts-mc( 0/ 4): - cum. max stack depth: 206
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 206 states 1007 transitions, fanout: 4.888
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6867, Transitions per second: 33567
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.5 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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-p1s2-LTLFireability-14
ltl formula formula --ltl=/tmp/712/ltl_14_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 570 places, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.570 real 0.220 user 0.180 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 25 states
pnml2lts-mc( 0/ 4): There are 437 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 571, there are 7752 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): ~1471 levels ~10000 states ~25160 transitions
pnml2lts-mc( 1/ 4): ~2871 levels ~20000 states ~48760 transitions
pnml2lts-mc( 1/ 4): ~5671 levels ~40000 states ~95960 transitions
pnml2lts-mc( 1/ 4): ~11271 levels ~80000 states ~190360 transitions
pnml2lts-mc( 1/ 4): ~22471 levels ~160000 states ~379160 transitions
pnml2lts-mc( 1/ 4): ~44871 levels ~320000 states ~756760 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 99344
pnml2lts-mc( 0/ 4): unique states count: 511006
pnml2lts-mc( 0/ 4): unique transitions count: 1749941
pnml2lts-mc( 0/ 4): - self-loop count: 99344
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 5469
pnml2lts-mc( 0/ 4): - claim success count: 511028
pnml2lts-mc( 0/ 4): - cum. max stack depth: 399707
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 511028 states 1750021 transitions, fanout: 3.425
pnml2lts-mc( 0/ 4): Total exploration time 66.740 sec (66.640 sec minimum, 66.680 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7657, Transitions per second: 26221
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 76.6MB, 48.8 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 7851 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 76.6MB (~256.0MB paged-in)
ltl formula name DoubleLock-PT-p1s2-LTLFireability-15
ltl formula formula --ltl=/tmp/712/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 570 places, 7600 transitions and 30784 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleLock-PT-p1s2 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.200 user 0.210 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/712/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/712/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/712/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/712/ltl_15_
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 7603 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~67!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 274
pnml2lts-mc( 0/ 4): unique transitions count: 1505
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 279
pnml2lts-mc( 0/ 4): - cum. max stack depth: 279
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 279 states 1529 transitions, fanout: 5.480
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4650, Transitions per second: 25483
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, 43.1 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7851 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)

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

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