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.r520-tall-171662338700500.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 Railroad-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662338700500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 13:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 13:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:43 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 Railroad-PT-050-LTLFireability-00
FORMULA_NAME Railroad-PT-050-LTLFireability-01
FORMULA_NAME Railroad-PT-050-LTLFireability-02
FORMULA_NAME Railroad-PT-050-LTLFireability-03
FORMULA_NAME Railroad-PT-050-LTLFireability-04
FORMULA_NAME Railroad-PT-050-LTLFireability-05
FORMULA_NAME Railroad-PT-050-LTLFireability-06
FORMULA_NAME Railroad-PT-050-LTLFireability-07
FORMULA_NAME Railroad-PT-050-LTLFireability-08
FORMULA_NAME Railroad-PT-050-LTLFireability-09
FORMULA_NAME Railroad-PT-050-LTLFireability-10
FORMULA_NAME Railroad-PT-050-LTLFireability-11
FORMULA_NAME Railroad-PT-050-LTLFireability-12
FORMULA_NAME Railroad-PT-050-LTLFireability-13
FORMULA_NAME Railroad-PT-050-LTLFireability-14
FORMULA_NAME Railroad-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717261222101

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:00:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:00:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:00:23] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-06-01 17:00:23] [INFO ] Transformed 518 places.
[2024-06-01 17:00:23] [INFO ] Transformed 2756 transitions.
[2024-06-01 17:00:23] [INFO ] Found NUPN structural information;
[2024-06-01 17:00:23] [INFO ] Parsed PT model containing 518 places and 2756 transitions and 16378 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 151 places in 33 ms
Reduce places removed 151 places and 50 transitions.
FORMULA Railroad-PT-050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 2706/2706 transitions.
Ensure Unique test removed 52 places
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 315 transition count 2706
Applied a total of 52 rules in 64 ms. Remains 315 /367 variables (removed 52) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2024-06-01 17:00:23] [INFO ] Invariants computation overflowed in 37 ms
[2024-06-01 17:00:24] [INFO ] Implicit Places using invariants in 645 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2024-06-01 17:00:24] [INFO ] Invariants computation overflowed in 9 ms
[2024-06-01 17:00:26] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2600 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/367 places, 2706/2706 transitions.
Applied a total of 0 rules in 19 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2699 ms. Remains : 260/367 places, 2706/2706 transitions.
Support contains 44 out of 260 places after structural reductions.
[2024-06-01 17:00:26] [INFO ] Flatten gal took : 239 ms
[2024-06-01 17:00:27] [INFO ] Flatten gal took : 151 ms
[2024-06-01 17:00:27] [INFO ] Input system was already deterministic with 2706 transitions.
Support contains 39 out of 260 places (down from 44) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (8 resets) in 3212 ms. (12 steps per ms) remains 11/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:00:28] [INFO ] Invariants computation overflowed in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1250/1271 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1271 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 4 (OVERLAPS) 1563/2834 variables, 147/189 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2834 variables, 147/336 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 17:00:29] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2834 variables, 1/337 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2834 variables, 0/337 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 132/2966 variables, 92/429 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 92/521 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 0/521 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/2966 variables, 0/521 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2966/2966 variables, and 521 constraints, problems are : Problem set: 2 solved, 7 unsolved in 4203 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 931/946 variables, 15/30 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1882/2828 variables, 150/180 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2828 variables, 150/330 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2828 variables, 7/337 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2828 variables, 1/338 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2828 variables, 0/338 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 138/2966 variables, 95/433 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 95/528 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 17:00:34] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2966 variables, 1/529 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2966 variables, 0/529 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/2966 variables, 0/529 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2966/2966 variables, and 529 constraints, problems are : Problem set: 2 solved, 7 unsolved in 3934 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 8255ms problems are : Problem set: 2 solved, 7 unsolved
Parikh walk visited 6 properties in 5615 ms.
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 691 ms. Remains 207 /260 variables (removed 53) and now considering 2653/2706 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 693 ms. Remains : 207/260 places, 2653/2706 transitions.
RANDOM walk for 40000 steps (8 resets) in 469 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 726521 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 726521 steps, saw 635697 distinct states, run finished after 3004 ms. (steps per millisecond=241 ) properties seen :0
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:00:46] [INFO ] Invariants computation overflowed in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/156 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2654/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/2860 variables, 50/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2860 variables, 50/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2860 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2860 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2860/2860 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 633 ms.
Refiners :[Domain max(s): 207/207 constraints, State Equation: 207/207 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/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/156 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2654/2810 variables, 154/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 154/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2810 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2810 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 50/2860 variables, 50/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2860 variables, 50/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2860 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2860 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2860/2860 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 671 ms.
Refiners :[Domain max(s): 207/207 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1347ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 287 ms.
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 529 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 529 ms. Remains : 207/207 places, 2653/2653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 449 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:00:49] [INFO ] Invariants computation overflowed in 19 ms
[2024-06-01 17:00:49] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:00:49] [INFO ] Invariants computation overflowed in 17 ms
[2024-06-01 17:00:50] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2024-06-01 17:00:50] [INFO ] Redundant transitions in 147 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:00:50] [INFO ] Invariants computation overflowed in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-06-01 17:01:25] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30068 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30055 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 69076ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 69105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71213 ms. Remains : 207/207 places, 2653/2653 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 50 Pre rules applied. Total rules applied 0 place count 207 transition count 2603
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 157 transition count 2603
Applied a total of 100 rules in 85 ms. Remains 157 /207 variables (removed 50) and now considering 2603/2653 (removed 50) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 157 cols
[2024-06-01 17:02:00] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-01 17:02:00] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:02:01] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:02:01] [INFO ] After 599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 17:02:01] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1418 ms.
FORMULA Railroad-PT-050-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA Railroad-PT-050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 15 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:02:01] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-01 17:02:02] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:02:02] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-01 17:02:03] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:02:03] [INFO ] Invariants computation overflowed in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (OVERLAPS) 2706/2916 variables, 210/420 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
[2024-06-01 17:02:38] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
[2024-06-01 17:02:40] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 2 ms to minimize.
[2024-06-01 17:02:41] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2916/2966 variables, and 423 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30038 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 3 (OVERLAPS) 2706/2916 variables, 210/423 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2916 variables, 105/528 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2916/2966 variables, and 528 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30057 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 105/2656 constraints, Known Traps: 3/3 constraints]
After SMT, in 69205ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 69231ms
Finished structural reductions in LTL mode , in 1 iterations and 70879 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Railroad-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-00 finished in 71293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 8 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:03:13] [INFO ] Invariants computation overflowed in 12 ms
[2024-06-01 17:03:13] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:03:13] [INFO ] Invariants computation overflowed in 9 ms
[2024-06-01 17:03:14] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:03:14] [INFO ] Invariants computation overflowed in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (OVERLAPS) 2706/2916 variables, 210/420 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
[2024-06-01 17:03:50] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-01 17:03:52] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 3 ms to minimize.
[2024-06-01 17:03:53] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2916/2966 variables, and 423 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30050 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 3 (OVERLAPS) 2706/2916 variables, 210/423 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2916 variables, 105/528 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2916/2966 variables, and 528 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30049 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 105/2656 constraints, Known Traps: 3/3 constraints]
After SMT, in 69806ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 69834ms
Finished structural reductions in LTL mode , in 1 iterations and 71399 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 94 ms :[p0, p0]
Running random walk in product with property : Railroad-PT-050-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 778 ms.
Product exploration explored 100000 steps with 50000 reset in 653 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-03 finished in 72999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 844 ms. Remains 208 /260 variables (removed 52) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-06-01 17:04:27] [INFO ] Invariants computation overflowed in 10 ms
[2024-06-01 17:04:27] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2024-06-01 17:04:27] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-01 17:04:28] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2024-06-01 17:04:28] [INFO ] Redundant transitions in 168 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-06-01 17:04:28] [INFO ] Invariants computation overflowed in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (OVERLAPS) 2654/2812 variables, 158/316 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
[2024-06-01 17:05:02] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2812/2862 variables, and 317 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30046 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2812 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 370 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30045 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 53/2604 constraints, Known Traps: 1/1 constraints]
After SMT, in 69102ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 69130ms
Starting structural reductions in SI_LTL mode, iteration 1 : 208/260 places, 2654/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71522 ms. Remains : 208/260 places, 2654/2706 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 1029 ms.
Product exploration explored 100000 steps with 0 reset in 1032 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
RANDOM walk for 23503 steps (4 resets) in 302 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Support contains 3 out of 208 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 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 466 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-06-01 17:05:40] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-01 17:05:41] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2024-06-01 17:05:41] [INFO ] Invariants computation overflowed in 8 ms
[2024-06-01 17:05:42] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
[2024-06-01 17:05:42] [INFO ] Redundant transitions in 78 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-06-01 17:05:42] [INFO ] Invariants computation overflowed in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (OVERLAPS) 2654/2812 variables, 158/316 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
[2024-06-01 17:06:16] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2812/2862 variables, and 317 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30040 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2812 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 370 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30048 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 53/2604 constraints, Known Traps: 1/1 constraints]
After SMT, in 68637ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 68659ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70639 ms. Remains : 208/208 places, 2654/2654 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
RANDOM walk for 29568 steps (6 resets) in 341 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 894 ms.
Product exploration explored 100000 steps with 0 reset in 1053 ms.
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 208 transition count 2653
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 2653
Applied a total of 2 rules in 439 ms. Remains 207 /208 variables (removed 1) and now considering 2653/2654 (removed 1) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:06:54] [INFO ] Invariants computation overflowed in 12 ms
[2024-06-01 17:06:54] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:06:54] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-01 17:06:55] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
[2024-06-01 17:06:55] [INFO ] Redundant transitions in 81 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:06:55] [INFO ] Invariants computation overflowed in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-06-01 17:07:31] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30043 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30067 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 69697ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 69725ms
Starting structural reductions in SI_LTL mode, iteration 1 : 207/208 places, 2653/2654 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71696 ms. Remains : 207/208 places, 2653/2654 transitions.
Treatment of property Railroad-PT-050-LTLFireability-04 finished in 219462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 526 ms. Remains 208 /260 variables (removed 52) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-06-01 17:08:06] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 17:08:06] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2024-06-01 17:08:06] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-01 17:08:07] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
[2024-06-01 17:08:07] [INFO ] Redundant transitions in 80 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-06-01 17:08:07] [INFO ] Invariants computation overflowed in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (OVERLAPS) 2654/2812 variables, 158/316 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
[2024-06-01 17:08:41] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2812/2862 variables, and 317 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30078 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2812 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 370 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30047 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 53/2604 constraints, Known Traps: 1/1 constraints]
After SMT, in 69635ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 69657ms
Starting structural reductions in SI_LTL mode, iteration 1 : 208/260 places, 2654/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71624 ms. Remains : 208/260 places, 2654/2706 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 914 ms.
Stack based approach found an accepted trace after 4067 steps with 0 reset with depth 4068 and stack size 4068 in 44 ms.
FORMULA Railroad-PT-050-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-050-LTLFireability-05 finished in 72740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(X(X(F(p1)))||(F(p3)&&p2)))))'
Support contains 7 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 14 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:09:18] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-01 17:09:18] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:09:18] [INFO ] Invariants computation overflowed in 5 ms
[2024-06-01 17:09:19] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:09:19] [INFO ] Invariants computation overflowed in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (OVERLAPS) 2706/2916 variables, 210/420 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
[2024-06-01 17:09:54] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:09:56] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:09:57] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2916/2966 variables, and 423 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30036 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 3 (OVERLAPS) 2706/2916 variables, 210/423 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2916 variables, 105/528 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2916/2966 variables, and 528 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30066 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 105/2656 constraints, Known Traps: 3/3 constraints]
After SMT, in 69600ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 69628ms
Finished structural reductions in LTL mode , in 1 iterations and 71155 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Railroad-PT-050-LTLFireability-07
Product exploration explored 100000 steps with 3 reset in 729 ms.
Product exploration explored 100000 steps with 0 reset in 865 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 6 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p3) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 611 ms. (65 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 3/3 properties
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:10:32] [INFO ] Invariants computation overflowed in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 300/305 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2513/2818 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2818 variables, 155/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2818 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 148/2966 variables, 100/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2966 variables, 100/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2966 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2966/2966 variables, and 520 constraints, problems are : Problem set: 0 solved, 3 unsolved in 650 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 300/305 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2513/2818 variables, 155/165 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2818 variables, 155/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2818 variables, 2/322 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2818 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 148/2966 variables, 100/422 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 100/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2966/2966 variables, and 522 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1196 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1879ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 1 properties in 640 ms.
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 501 ms. Remains 207 /260 variables (removed 53) and now considering 2653/2706 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 207/260 places, 2653/2706 transitions.
RANDOM walk for 40000 steps (8 resets) in 577 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33504 steps (7 resets) in 71 ms. (465 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p1))), (G (OR p3 (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1), (F p3), (F (NOT (AND (NOT p1) (NOT p3)))), (F p0)]
Knowledge based reduction with 8 factoid took 204 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1)]
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:10:36] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 17:10:37] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2024-06-01 17:10:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:39] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 1 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 514 ms
Proved EG (NOT p0)
// Phase 1: matrix 2706 rows 260 cols
[2024-06-01 17:10:39] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-01 17:10:41] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2024-06-01 17:10:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:42] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-06-01 17:10:42] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 1 ms to minimize.
[2024-06-01 17:10:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 377 ms
Proved EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p1))), (G (OR p3 (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1), (F p3), (F (NOT (AND (NOT p1) (NOT p3)))), (F p0), (G (NOT p0)), (G (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-07 finished in 85031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 4 place count 258 transition count 2653
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 106 place count 207 transition count 2653
Applied a total of 106 rules in 514 ms. Remains 207 /260 variables (removed 53) and now considering 2653/2706 (removed 53) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:10:43] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 17:10:44] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:10:44] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-01 17:10:45] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2024-06-01 17:10:45] [INFO ] Redundant transitions in 88 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:10:45] [INFO ] Invariants computation overflowed in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-06-01 17:11:18] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30046 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30068 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 69182ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 69211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 207/260 places, 2653/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71264 ms. Remains : 207/260 places, 2653/2706 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 847 ms.
Product exploration explored 100000 steps with 0 reset in 1006 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 12516 steps (1 resets) in 144 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 485 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:11:57] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 17:11:57] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:11:57] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-01 17:11:58] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
[2024-06-01 17:11:59] [INFO ] Redundant transitions in 75 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:11:59] [INFO ] Invariants computation overflowed in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-06-01 17:12:33] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30061 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30053 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 69230ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 69256ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71267 ms. Remains : 207/207 places, 2653/2653 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 3051 steps (0 resets) in 35 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 298 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 913 ms.
Product exploration explored 100000 steps with 0 reset in 916 ms.
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2653/2653 transitions.
Applied a total of 0 rules in 434 ms. Remains 207 /207 variables (removed 0) and now considering 2653/2653 (removed 0) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:13:11] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 17:13:11] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:13:11] [INFO ] Invariants computation overflowed in 3 ms
[2024-06-01 17:13:12] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2024-06-01 17:13:12] [INFO ] Redundant transitions in 78 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-06-01 17:13:12] [INFO ] Invariants computation overflowed in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-06-01 17:13:46] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30045 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30054 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 69569ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 69591ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71538 ms. Remains : 207/207 places, 2653/2653 transitions.
Treatment of property Railroad-PT-050-LTLFireability-09 finished in 219131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G((p1&&(p1 U (!p2||G(p1))))))))'
Support contains 5 out of 260 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 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 4 place count 258 transition count 2655
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 102 place count 209 transition count 2655
Applied a total of 102 rules in 537 ms. Remains 209 /260 variables (removed 51) and now considering 2655/2706 (removed 51) transitions.
// Phase 1: matrix 2655 rows 209 cols
[2024-06-01 17:14:23] [INFO ] Invariants computation overflowed in 14 ms
[2024-06-01 17:14:23] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 2655 rows 209 cols
[2024-06-01 17:14:23] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 17:14:24] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2024-06-01 17:14:24] [INFO ] Redundant transitions in 83 ms returned []
Running 2605 sub problems to find dead transitions.
// Phase 1: matrix 2655 rows 209 cols
[2024-06-01 17:14:24] [INFO ] Invariants computation overflowed in 7 ms
FORMULA Railroad-PT-050-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Railroad-PT-050-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Railroad-PT-050-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Railroad-PT-050-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Railroad-PT-050-LTLFireability-04
FORMULA Railroad-PT-050-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Railroad-PT-050-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Railroad-PT-050-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Railroad-PT-050-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Railroad-PT-050-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Railroad-PT-050-LTLFireability-10
Could not compute solution for formula : Railroad-PT-050-LTLFireability-11
FORMULA Railroad-PT-050-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Railroad-PT-050-LTLFireability-13
FORMULA Railroad-PT-050-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Railroad-PT-050-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717262173073

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Railroad-PT-050-LTLFireability-00
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.110 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_0_
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 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2759 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 ~41!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 118
pnml2lts-mc( 0/ 4): unique transitions count: 2952
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: 121
pnml2lts-mc( 0/ 4): - cum. max stack depth: 121
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 121 states 3106 transitions, fanout: 25.669
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.040 sec minimum, 0.053 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2017, Transitions per second: 51767
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, 51.9 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 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 Railroad-PT-050-LTLFireability-01
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.120 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2759 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 ~18!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 62
pnml2lts-mc( 0/ 4): unique transitions count: 1345
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: 65
pnml2lts-mc( 0/ 4): - cum. max stack depth: 65
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 65 states 1499 transitions, fanout: 23.062
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: 3250, Transitions per second: 74950
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, 55.3 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 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 Railroad-PT-050-LTLFireability-02
ltl formula formula --ltl=/tmp/1158/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_2_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.590 real 0.090 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2757 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 752.0 B/state, compr.: 36.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 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 Railroad-PT-050-LTLFireability-03
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.110 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2761 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 51
pnml2lts-mc( 0/ 4): unique states count: 51
pnml2lts-mc( 0/ 4): unique transitions count: 100
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 223
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 61
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 61 states 404 transitions, fanout: 6.623
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6100, Transitions per second: 40400
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, 125.5 B/state, compr.: 6.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 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 Railroad-PT-050-LTLFireability-04
ltl formula formula --ltl=/tmp/1158/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.100 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 369 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2763 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): ~2444 levels ~10000 states ~272328 transitions
pnml2lts-mc( 2/ 4): ~4914 levels ~20000 states ~532284 transitions
pnml2lts-mc( 2/ 4): ~9781 levels ~40000 states ~1040472 transitions
pnml2lts-mc( 2/ 4): ~19324 levels ~80000 states ~2054856 transitions
pnml2lts-mc( 2/ 4): ~38125 levels ~160000 states ~4109896 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 305337
pnml2lts-mc( 0/ 4): unique transitions count: 8612082
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 505869
pnml2lts-mc( 0/ 4): - claim success count: 305345
pnml2lts-mc( 0/ 4): - cum. max stack depth: 298425
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 305345 states 8612249 transitions, fanout: 28.205
pnml2lts-mc( 0/ 4): Total exploration time 21.590 sec (21.470 sec minimum, 21.533 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14143, Transitions per second: 398900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 121.7MB, 16.9 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 2806 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 121.7MB (~256.0MB paged-in)
ltl formula name Railroad-PT-050-LTLFireability-05
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.100 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 369 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2766 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 ~10!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 44
pnml2lts-mc( 0/ 4): unique transitions count: 926
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: 47
pnml2lts-mc( 0/ 4): - cum. max stack depth: 47
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 47 states 1080 transitions, fanout: 22.979
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: 2350, Transitions per second: 54000
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, 57.4 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 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 Railroad-PT-050-LTLFireability-06
ltl formula formula --ltl=/tmp/1158/ltl_6_
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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.090 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_6_
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 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2759 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 131
pnml2lts-mc( 0/ 4): unique transitions count: 6470
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: 134
pnml2lts-mc( 0/ 4): - cum. max stack depth: 134
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 134 states 6624 transitions, fanout: 49.433
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: 3350, Transitions per second: 165600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 52.5 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name Railroad-PT-050-LTLFireability-07
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.110 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_7_
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 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2762 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 ~26!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 99
pnml2lts-mc( 0/ 4): unique transitions count: 2511
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: 102
pnml2lts-mc( 0/ 4): - cum. max stack depth: 102
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 102 states 2965 transitions, fanout: 29.069
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: 2550, Transitions per second: 74125
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, 52.0 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 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 Railroad-PT-050-LTLFireability-08
ltl formula formula --ltl=/tmp/1158/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.070 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/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 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2764 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 ~12!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 51
pnml2lts-mc( 0/ 4): unique transitions count: 1033
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: 54
pnml2lts-mc( 0/ 4): - cum. max stack depth: 54
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 54 states 1187 transitions, fanout: 21.981
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: 2700, Transitions per second: 59350
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, 57.0 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 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 Railroad-PT-050-LTLFireability-09
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.080 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 369 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2762 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): ~2496 levels ~10000 states ~259204 transitions
pnml2lts-mc( 3/ 4): ~4969 levels ~20000 states ~503484 transitions
pnml2lts-mc( 3/ 4): ~9895 levels ~40000 states ~1001696 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~10353!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 46099
pnml2lts-mc( 0/ 4): unique transitions count: 1297276
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 72071
pnml2lts-mc( 0/ 4): - claim success count: 46102
pnml2lts-mc( 0/ 4): - cum. max stack depth: 45031
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 46102 states 1297430 transitions, fanout: 28.143
pnml2lts-mc( 0/ 4): Total exploration time 3.370 sec (3.370 sec minimum, 3.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 13680, Transitions per second: 384994
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 22.9MB, 20.7 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 3.0%/21.0%
pnml2lts-mc( 0/ 4): Stored 2806 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 22.9MB (~256.0MB paged-in)
ltl formula name Railroad-PT-050-LTLFireability-10
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.100 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 369 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2762 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): ~2492 levels ~10000 states ~236856 transitions
pnml2lts-mc( 3/ 4): ~4981 levels ~20000 states ~476132 transitions
pnml2lts-mc( 3/ 4): ~9953 levels ~40000 states ~965508 transitions
pnml2lts-mc( 3/ 4): ~19862 levels ~80000 states ~1945204 transitions
pnml2lts-mc( 3/ 4): ~39694 levels ~160000 states ~3911448 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 292476
pnml2lts-mc( 0/ 4): unique transitions count: 8327411
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 517112
pnml2lts-mc( 0/ 4): - claim success count: 292479
pnml2lts-mc( 0/ 4): - cum. max stack depth: 287981
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 292479 states 8327502 transitions, fanout: 28.472
pnml2lts-mc( 0/ 4): Total exploration time 21.430 sec (21.050 sec minimum, 21.205 sec on average)
pnml2lts-mc( 0/ 4): States per second: 13648, Transitions per second: 388591
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 119.1MB, 17.3 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 2806 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 119.1MB (~256.0MB paged-in)
ltl formula name Railroad-PT-050-LTLFireability-11
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.110 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/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 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2759 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): ~2450 levels ~10000 states ~255384 transitions
pnml2lts-mc( 3/ 4): ~4878 levels ~20000 states ~505780 transitions
pnml2lts-mc( 3/ 4): ~9673 levels ~40000 states ~1014964 transitions
pnml2lts-mc( 3/ 4): ~19232 levels ~80000 states ~2031500 transitions
pnml2lts-mc( 3/ 4): ~38425 levels ~160000 states ~4132308 transitions
pnml2lts-mc( 2/ 4): ~78558 levels ~320000 states ~8358252 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 323281
pnml2lts-mc( 0/ 4): unique transitions count: 8448322
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 699028
pnml2lts-mc( 0/ 4): - claim success count: 323284
pnml2lts-mc( 0/ 4): - cum. max stack depth: 314822
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 323284 states 8448384 transitions, fanout: 26.133
pnml2lts-mc( 0/ 4): Total exploration time 19.580 sec (19.340 sec minimum, 19.423 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16511, Transitions per second: 431480
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 118.8MB, 17.3 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 2806 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 118.8MB (~256.0MB paged-in)
ltl formula name Railroad-PT-050-LTLFireability-12
ltl formula formula --ltl=/tmp/1158/ltl_12_
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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.080 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/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 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2759 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 752.0 B/state, compr.: 36.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 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 Railroad-PT-050-LTLFireability-13
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.110 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 369 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2769 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): ~2480 levels ~10000 states ~256476 transitions
pnml2lts-mc( 3/ 4): ~4965 levels ~20000 states ~516476 transitions
pnml2lts-mc( 3/ 4): ~9938 levels ~40000 states ~1035292 transitions
pnml2lts-mc( 3/ 4): ~19842 levels ~80000 states ~2073056 transitions
pnml2lts-mc( 3/ 4): ~39621 levels ~160000 states ~4128120 transitions
pnml2lts-mc( 0/ 4): ~33086 levels ~320000 states ~4615808 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 70096
pnml2lts-mc( 0/ 4): unique states count: 363554
pnml2lts-mc( 0/ 4): unique transitions count: 8710488
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8275
pnml2lts-mc( 0/ 4): - claim found count: 532308
pnml2lts-mc( 0/ 4): - claim success count: 363562
pnml2lts-mc( 0/ 4): - cum. max stack depth: 290110
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 363562 states 8710622 transitions, fanout: 23.959
pnml2lts-mc( 0/ 4): Total exploration time 21.510 sec (21.290 sec minimum, 21.408 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16902, Transitions per second: 404957
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 122.6MB, 16.7 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 2806 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 122.6MB (~256.0MB paged-in)
ltl formula name Railroad-PT-050-LTLFireability-14
ltl formula formula --ltl=/tmp/1158/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.110 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_14_
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 370 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2760 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 ~31!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 131
pnml2lts-mc( 0/ 4): unique transitions count: 3158
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: 134
pnml2lts-mc( 0/ 4): - cum. max stack depth: 134
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 134 states 3312 transitions, fanout: 24.716
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: 3350, Transitions per second: 82800
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.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2806 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 Railroad-PT-050-LTLFireability-15
ltl formula formula --ltl=/tmp/1158/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 518 places, 2756 transitions and 16378 arcs
pnml2lts-mc( 0/ 4): Petri net Railroad-PT-050 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.090 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1158/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1158/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1158/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1158/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 369 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 519, there are 2763 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 ~487!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2110
pnml2lts-mc( 0/ 4): unique transitions count: 57077
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1169
pnml2lts-mc( 0/ 4): - claim success count: 2113
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2095
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2113 states 57231 transitions, fanout: 27.085
pnml2lts-mc( 0/ 4): Total exploration time 0.310 sec (0.300 sec minimum, 0.305 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6816, Transitions per second: 184616
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.5MB, 29.1 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 2806 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.5MB (~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="Railroad-PT-050"
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 Railroad-PT-050, 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 r520-tall-171662338700500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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