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.r536-tall-171690533400891.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 Szymanski-PT-b10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533400891
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 11 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 11 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 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 3.7M 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 Szymanski-PT-b10-LTLCardinality-00
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-01
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-02
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-03
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-04
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-05
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-06
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-07
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-08
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-09
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-10
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-11
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-12
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-13
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-14
FORMULA_NAME Szymanski-PT-b10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717284664028

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:31:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 23:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:31:05] [INFO ] Load time of PNML (sax parser for PT used): 363 ms
[2024-06-01 23:31:05] [INFO ] Transformed 568 places.
[2024-06-01 23:31:05] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:31:05] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 533 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 307 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2024-06-01 23:31:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-06-01 23:31:06] [INFO ] Computed 1 invariants in 54 ms
[2024-06-01 23:31:07] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-06-01 23:31:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:31:07] [INFO ] Invariant cache hit.
[2024-06-01 23:31:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:31:39] [INFO ] Performed 272/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:31:47] [INFO ] Implicit Places using invariants and state equation in 40107 ms returned []
Implicit Place search using SMT with State Equation took 40832 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:31:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:31:47] [INFO ] Invariant cache hit.
[2024-06-01 23:31:47] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30162 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30088 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 88249ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 88364ms
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129562 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 13 out of 305 places after structural reductions.
[2024-06-01 23:33:16] [INFO ] Flatten gal took : 462 ms
[2024-06-01 23:33:16] [INFO ] Flatten gal took : 275 ms
[2024-06-01 23:33:17] [INFO ] Input system was already deterministic with 7936 transitions.
RANDOM walk for 40020 steps (14 resets) in 1467 ms. (27 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 164 ms. (242 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (12 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
[2024-06-01 23:33:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:33:17] [INFO ] Invariant cache hit.
[2024-06-01 23:33:17] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 298/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 1 solved, 4 unsolved in 892 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 299/305 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 1 solved, 4 unsolved in 3139 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 4071ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 1457 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 428 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40018 steps (8 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
[2024-06-01 23:33:24] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-06-01 23:33:24] [INFO ] Computed 2 invariants in 23 ms
[2024-06-01 23:33:24] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 643 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:33:25] [INFO ] Deduced a trap composed of 45 places in 555 ms of which 19 ms to minimize.
[2024-06-01 23:33:25] [INFO ] Deduced a trap composed of 114 places in 547 ms of which 3 ms to minimize.
[2024-06-01 23:33:26] [INFO ] Deduced a trap composed of 36 places in 491 ms of which 11 ms to minimize.
[2024-06-01 23:33:26] [INFO ] Deduced a trap composed of 47 places in 494 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2605/2910 variables, 305/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2910 variables, 147/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16201 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 16904ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 203 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 305/305 places, 7809/7809 transitions.
RANDOM walk for 40021 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 197936 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 2
Probabilistic random walk after 197936 steps, saw 154856 distinct states, run finished after 3009 ms. (steps per millisecond=65 ) properties seen :0
[2024-06-01 23:33:44] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 23:33:44] [INFO ] Invariant cache hit.
[2024-06-01 23:33:44] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 736 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:33:45] [INFO ] Deduced a trap composed of 45 places in 511 ms of which 5 ms to minimize.
[2024-06-01 23:33:46] [INFO ] Deduced a trap composed of 48 places in 384 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2605/2910 variables, 305/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2910 variables, 147/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:34:06] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 1 ms to minimize.
[2024-06-01 23:34:07] [INFO ] Deduced a trap composed of 58 places in 340 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 22794 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 23567ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 787 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7808
Applied a total of 1 rules in 303 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7809 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 305/305 places, 7808/7809 transitions.
RANDOM walk for 40012 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 250849 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 250849 steps, saw 188396 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-01 23:34:12] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:34:12] [INFO ] Computed 3 invariants in 24 ms
[2024-06-01 23:34:12] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 23:34:13] [INFO ] Deduced a trap composed of 91 places in 406 ms of which 2 ms to minimize.
[2024-06-01 23:34:13] [INFO ] Deduced a trap composed of 138 places in 390 ms of which 2 ms to minimize.
[2024-06-01 23:34:14] [INFO ] Deduced a trap composed of 138 places in 394 ms of which 2 ms to minimize.
[2024-06-01 23:34:14] [INFO ] Deduced a trap composed of 72 places in 379 ms of which 2 ms to minimize.
[2024-06-01 23:34:14] [INFO ] Deduced a trap composed of 101 places in 370 ms of which 1 ms to minimize.
[2024-06-01 23:34:15] [INFO ] Deduced a trap composed of 130 places in 379 ms of which 1 ms to minimize.
[2024-06-01 23:34:15] [INFO ] Deduced a trap composed of 133 places in 380 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2604/2909 variables, 305/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 147/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 23:34:18] [INFO ] Deduced a trap composed of 104 places in 477 ms of which 2 ms to minimize.
[2024-06-01 23:34:23] [INFO ] Deduced a trap composed of 114 places in 398 ms of which 2 ms to minimize.
[2024-06-01 23:34:23] [INFO ] Deduced a trap composed of 45 places in 332 ms of which 2 ms to minimize.
[2024-06-01 23:34:24] [INFO ] Deduced a trap composed of 64 places in 317 ms of which 2 ms to minimize.
[2024-06-01 23:34:24] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 5/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11827 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 12591ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:34:25] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:34:25] [INFO ] Invariant cache hit.
[2024-06-01 23:34:25] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-06-01 23:34:25] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:34:25] [INFO ] Invariant cache hit.
[2024-06-01 23:34:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:34:47] [INFO ] Implicit Places using invariants and state equation in 21437 ms returned []
Implicit Place search using SMT with State Equation took 22077 ms to find 0 implicit places.
[2024-06-01 23:34:48] [INFO ] Redundant transitions in 881 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:34:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:34:48] [INFO ] Invariant cache hit.
[2024-06-01 23:34:48] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:35:50] [INFO ] Deduced a trap composed of 138 places in 395 ms of which 2 ms to minimize.
[2024-06-01 23:35:51] [INFO ] Deduced a trap composed of 48 places in 332 ms of which 2 ms to minimize.
[2024-06-01 23:35:52] [INFO ] Deduced a trap composed of 118 places in 316 ms of which 1 ms to minimize.
[2024-06-01 23:35:52] [INFO ] Deduced a trap composed of 157 places in 305 ms of which 2 ms to minimize.
[2024-06-01 23:35:52] [INFO ] Deduced a trap composed of 101 places in 226 ms of which 2 ms to minimize.
[2024-06-01 23:35:53] [INFO ] Deduced a trap composed of 72 places in 305 ms of which 2 ms to minimize.
[2024-06-01 23:35:53] [INFO ] Deduced a trap composed of 85 places in 250 ms of which 2 ms to minimize.
[2024-06-01 23:35:53] [INFO ] Deduced a trap composed of 74 places in 341 ms of which 2 ms to minimize.
[2024-06-01 23:35:54] [INFO ] Deduced a trap composed of 111 places in 323 ms of which 2 ms to minimize.
[2024-06-01 23:35:54] [INFO ] Deduced a trap composed of 103 places in 233 ms of which 2 ms to minimize.
[2024-06-01 23:35:54] [INFO ] Deduced a trap composed of 107 places in 318 ms of which 2 ms to minimize.
[2024-06-01 23:35:55] [INFO ] Deduced a trap composed of 112 places in 323 ms of which 2 ms to minimize.
[2024-06-01 23:35:55] [INFO ] Deduced a trap composed of 103 places in 233 ms of which 1 ms to minimize.
[2024-06-01 23:35:55] [INFO ] Deduced a trap composed of 132 places in 212 ms of which 2 ms to minimize.
[2024-06-01 23:35:56] [INFO ] Deduced a trap composed of 134 places in 329 ms of which 6 ms to minimize.
[2024-06-01 23:35:56] [INFO ] Deduced a trap composed of 134 places in 310 ms of which 2 ms to minimize.
[2024-06-01 23:35:56] [INFO ] Deduced a trap composed of 125 places in 289 ms of which 2 ms to minimize.
[2024-06-01 23:35:56] [INFO ] Deduced a trap composed of 195 places in 196 ms of which 2 ms to minimize.
[2024-06-01 23:36:12] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 22 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 19/19 constraints]
After SMT, in 88500ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88581ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111755 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b10-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 11 stabilizing places and 2304 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' '!(F(G(p0)))'
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 473 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-06-01 23:36:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-06-01 23:36:17] [INFO ] Computed 1 invariants in 28 ms
[2024-06-01 23:36:17] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-01 23:36:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:36:17] [INFO ] Invariant cache hit.
[2024-06-01 23:36:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:36:46] [INFO ] Implicit Places using invariants and state equation in 28736 ms returned []
Implicit Place search using SMT with State Equation took 29182 ms to find 0 implicit places.
[2024-06-01 23:36:47] [INFO ] Redundant transitions in 790 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:36:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:36:47] [INFO ] Invariant cache hit.
[2024-06-01 23:36:47] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30101 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30084 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 89377ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 89442ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 119927 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b10-LTLCardinality-04
Product exploration explored 100000 steps with 18 reset in 499 ms.
Product exploration explored 100000 steps with 35 reset in 452 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 28 ms :[(NOT p0)]
RANDOM walk for 40012 steps (12 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
BEST_FIRST walk for 27703 steps (9 resets) in 50 ms. (543 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 93 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-06-01 23:38:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:38:18] [INFO ] Invariant cache hit.
[2024-06-01 23:38:19] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-06-01 23:38:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:38:19] [INFO ] Invariant cache hit.
[2024-06-01 23:38:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:38:47] [INFO ] Implicit Places using invariants and state equation in 28880 ms returned []
Implicit Place search using SMT with State Equation took 29315 ms to find 0 implicit places.
[2024-06-01 23:38:48] [INFO ] Redundant transitions in 650 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:38:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:38:48] [INFO ] Invariant cache hit.
[2024-06-01 23:38:48] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 344.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30106 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30174 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 87820ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 87890ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 118090 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 659 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 337 ms :[(NOT p0)]
RANDOM walk for 40023 steps (10 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 24142 steps (6 resets) in 29 ms. (804 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 1500 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 498 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 448 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 313 ms :[(NOT p0)]
Product exploration explored 100000 steps with 79 reset in 694 ms.
Product exploration explored 100000 steps with 37 reset in 589 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 228 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-06-01 23:40:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:40:22] [INFO ] Invariant cache hit.
[2024-06-01 23:40:53] [INFO ] Performed 129/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:41:23] [INFO ] Performed 260/305 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 23:41:30] [INFO ] Implicit Places using invariants in 68393 ms returned []
[2024-06-01 23:41:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:41:30] [INFO ] Invariant cache hit.
Could not compute solution for formula : Szymanski-PT-b10-LTLCardinality-00
Could not compute solution for formula : Szymanski-PT-b10-LTLCardinality-01
FORMULA Szymanski-PT-b10-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b10-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b10-LTLCardinality-04
Could not compute solution for formula : Szymanski-PT-b10-LTLCardinality-05
Could not compute solution for formula : Szymanski-PT-b10-LTLCardinality-06
Could not compute solution for formula : Szymanski-PT-b10-LTLCardinality-07
FORMULA Szymanski-PT-b10-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b10-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b10-LTLCardinality-10
Could not compute solution for formula : Szymanski-PT-b10-LTLCardinality-11
FORMULA Szymanski-PT-b10-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b10-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b10-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b10-LTLCardinality-15

BK_STOP 1717287351607

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Szymanski-PT-b10-LTLCardinality-00
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.700 real 0.310 user 0.320 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8324 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): ~1165 levels ~10000 states ~57836 transitions
pnml2lts-mc( 0/ 4): ~1299 levels ~20000 states ~117912 transitions
pnml2lts-mc( 0/ 4): ~1299 levels ~40000 states ~252588 transitions
pnml2lts-mc( 0/ 4): ~1349 levels ~80000 states ~552820 transitions
pnml2lts-mc( 0/ 4): ~1549 levels ~160000 states ~1173476 transitions
pnml2lts-mc( 3/ 4): ~9091 levels ~320000 states ~2120544 transitions
pnml2lts-mc( 3/ 4): ~9091 levels ~640000 states ~4305636 transitions
pnml2lts-mc( 3/ 4): ~9396 levels ~1280000 states ~9022920 transitions
ltl formula name Szymanski-PT-b10-LTLCardinality-01
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.900 real 0.280 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8332 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): ~2108 levels ~10000 states ~51468 transitions
pnml2lts-mc( 1/ 4): ~2108 levels ~20000 states ~106276 transitions
pnml2lts-mc( 1/ 4): ~2108 levels ~40000 states ~220720 transitions
pnml2lts-mc( 1/ 4): ~2108 levels ~80000 states ~475872 transitions
pnml2lts-mc( 2/ 4): ~3802 levels ~160000 states ~1005268 transitions
pnml2lts-mc( 2/ 4): ~3802 levels ~320000 states ~2130424 transitions
pnml2lts-mc( 2/ 4): ~3846 levels ~640000 states ~4321884 transitions
pnml2lts-mc( 3/ 4): ~6402 levels ~1280000 states ~5232544 transitions
ltl formula name Szymanski-PT-b10-LTLCardinality-02
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.900 real 0.320 user 0.250 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8323 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 ~65!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 270
pnml2lts-mc( 0/ 4): unique transitions count: 1573
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: 276
pnml2lts-mc( 0/ 4): - cum. max stack depth: 276
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 276 states 1595 transitions, fanout: 5.779
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4600, Transitions per second: 26583
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, 41.1 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 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 Szymanski-PT-b10-LTLCardinality-03
ltl formula formula --ltl=/tmp/844/ltl_3_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.270 user 0.260 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8337 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, 128.0 B/state, compr.: 5.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 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 Szymanski-PT-b10-LTLCardinality-04
ltl formula formula --ltl=/tmp/844/ltl_4_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.310 user 0.240 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8330 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): ~516 levels ~10000 states ~37240 transitions
pnml2lts-mc( 3/ 4): ~516 levels ~20000 states ~75236 transitions
pnml2lts-mc( 3/ 4): ~516 levels ~40000 states ~148456 transitions
pnml2lts-mc( 3/ 4): ~635 levels ~80000 states ~317212 transitions
pnml2lts-mc( 1/ 4): ~1828 levels ~160000 states ~1067012 transitions
pnml2lts-mc( 1/ 4): ~1870 levels ~320000 states ~2262952 transitions
pnml2lts-mc( 0/ 4): ~7761 levels ~640000 states ~2954320 transitions
ltl formula name Szymanski-PT-b10-LTLCardinality-05
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.710 real 0.310 user 0.290 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_5_
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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8323 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): ~665 levels ~10000 states ~52124 transitions
pnml2lts-mc( 2/ 4): ~1191 levels ~20000 states ~105424 transitions
pnml2lts-mc( 2/ 4): ~1191 levels ~40000 states ~219840 transitions
pnml2lts-mc( 2/ 4): ~1191 levels ~80000 states ~467656 transitions
pnml2lts-mc( 2/ 4): ~1274 levels ~160000 states ~1020700 transitions
pnml2lts-mc( 1/ 4): ~665 levels ~320000 states ~2241924 transitions
pnml2lts-mc( 1/ 4): ~683 levels ~640000 states ~4531696 transitions
ltl formula name Szymanski-PT-b10-LTLCardinality-06
ltl formula formula --ltl=/tmp/844/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.580 real 0.280 user 0.310 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8324 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): ~1407 levels ~10000 states ~51192 transitions
pnml2lts-mc( 3/ 4): ~1407 levels ~20000 states ~105296 transitions
pnml2lts-mc( 3/ 4): ~1407 levels ~40000 states ~219416 transitions
pnml2lts-mc( 1/ 4): ~2077 levels ~80000 states ~483036 transitions
pnml2lts-mc( 1/ 4): ~2077 levels ~160000 states ~1035932 transitions
pnml2lts-mc( 0/ 4): ~2228 levels ~320000 states ~2002088 transitions
pnml2lts-mc( 0/ 4): ~2228 levels ~640000 states ~4475664 transitions
ltl formula name Szymanski-PT-b10-LTLCardinality-07
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.890 real 0.270 user 0.260 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8324 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): ~771 levels ~10000 states ~51796 transitions
pnml2lts-mc( 3/ 4): ~771 levels ~20000 states ~118352 transitions
pnml2lts-mc( 3/ 4): ~1029 levels ~40000 states ~253792 transitions
pnml2lts-mc( 3/ 4): ~1159 levels ~80000 states ~539428 transitions
pnml2lts-mc( 3/ 4): ~1159 levels ~160000 states ~1119756 transitions
pnml2lts-mc( 3/ 4): ~1159 levels ~320000 states ~2365188 transitions
pnml2lts-mc( 3/ 4): ~1159 levels ~640000 states ~5001896 transitions
pnml2lts-mc( 3/ 4): ~1159 levels ~1280000 states ~10377856 transitions
ltl formula name Szymanski-PT-b10-LTLCardinality-08
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.300 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8334 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~86!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 342
pnml2lts-mc( 0/ 4): unique transitions count: 1904
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: 349
pnml2lts-mc( 0/ 4): - cum. max stack depth: 349
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 349 states 1930 transitions, fanout: 5.530
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5817, Transitions per second: 32167
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 45.1 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 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 Szymanski-PT-b10-LTLCardinality-09
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.270 user 0.240 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8322 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 ~107!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 406
pnml2lts-mc( 0/ 4): unique transitions count: 1941
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: 415
pnml2lts-mc( 0/ 4): - cum. max stack depth: 415
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 415 states 1969 transitions, fanout: 4.745
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5188, Transitions per second: 24612
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 45.8 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 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 Szymanski-PT-b10-LTLCardinality-10
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.780 real 0.270 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_10_
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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8329 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): ~841 levels ~10000 states ~52728 transitions
pnml2lts-mc( 3/ 4): ~841 levels ~20000 states ~112484 transitions
pnml2lts-mc( 3/ 4): ~879 levels ~40000 states ~237092 transitions
pnml2lts-mc( 0/ 4): ~1826 levels ~80000 states ~515580 transitions
pnml2lts-mc( 2/ 4): ~19135 levels ~160000 states ~958136 transitions
pnml2lts-mc( 2/ 4): ~19135 levels ~320000 states ~1957096 transitions
pnml2lts-mc( 3/ 4): ~944 levels ~640000 states ~4657088 transitions
ltl formula name Szymanski-PT-b10-LTLCardinality-11
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.900 real 0.300 user 0.220 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8341 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): ~1241 levels ~10000 states ~51900 transitions
pnml2lts-mc( 3/ 4): ~1242 levels ~20000 states ~104724 transitions
pnml2lts-mc( 3/ 4): ~1242 levels ~40000 states ~207588 transitions
pnml2lts-mc( 2/ 4): ~1577 levels ~80000 states ~445796 transitions
pnml2lts-mc( 2/ 4): ~2124 levels ~160000 states ~935668 transitions
pnml2lts-mc( 3/ 4): ~2136 levels ~320000 states ~2014244 transitions
pnml2lts-mc( 3/ 4): ~2136 levels ~640000 states ~4300204 transitions
pnml2lts-mc( 0/ 4): ~18546 levels ~1280000 states ~9227932 transitions
ltl formula name Szymanski-PT-b10-LTLCardinality-12
ltl formula formula --ltl=/tmp/844/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.260 user 0.260 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8331 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 ~146!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 574
pnml2lts-mc( 0/ 4): unique transitions count: 2827
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: 585
pnml2lts-mc( 0/ 4): - cum. max stack depth: 585
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 585 states 2858 transitions, fanout: 4.885
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5850, Transitions per second: 28580
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, 47.7 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 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 Szymanski-PT-b10-LTLCardinality-13
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.780 real 0.310 user 0.220 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_13_
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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8324 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 ~88!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 322
pnml2lts-mc( 0/ 4): unique transitions count: 1850
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: 327
pnml2lts-mc( 0/ 4): - cum. max stack depth: 327
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 327 states 1868 transitions, fanout: 5.713
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5450, Transitions per second: 31133
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, 42.5 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 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 Szymanski-PT-b10-LTLCardinality-14
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.740 real 0.250 user 0.280 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_14_
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 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8327 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~99!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 391
pnml2lts-mc( 0/ 4): unique transitions count: 2126
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 399
pnml2lts-mc( 0/ 4): - cum. max stack depth: 399
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 399 states 2156 transitions, fanout: 5.404
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5700, Transitions per second: 30800
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, 46.2 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8571 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 Szymanski-PT-b10-LTLCardinality-15
ltl formula formula --ltl=/tmp/844/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 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.740 real 0.270 user 0.280 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/844/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/844/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/844/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/844/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8329 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): ~667 levels ~10000 states ~39492 transitions
pnml2lts-mc( 0/ 4): ~2846 levels ~20000 states ~118228 transitions
pnml2lts-mc( 0/ 4): ~2975 levels ~40000 states ~239828 transitions
pnml2lts-mc( 2/ 4): ~1590 levels ~80000 states ~466472 transitions
pnml2lts-mc( 2/ 4): ~1590 levels ~160000 states ~1026944 transitions
pnml2lts-mc( 2/ 4): ~1590 levels ~320000 states ~2078100 transitions
pnml2lts-mc( 1/ 4): ~17018 levels ~640000 states ~3380176 transitions
pnml2lts-mc( 1/ 4): ~17018 levels ~1280000 states ~6455976 transitions

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="Szymanski-PT-b10"
export BK_EXAMINATION="LTLCardinality"
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 Szymanski-PT-b10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690533400891"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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