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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 15:05 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-b06-LTLCardinality-00
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-01
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-02
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-03
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-04
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-05
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-06
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-07
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-08
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-09
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-10
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-11
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-12
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-13
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-14
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717283168050

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-b06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:06:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 23:06:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:06:09] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2024-06-01 23:06:09] [INFO ] Transformed 568 places.
[2024-06-01 23:06:09] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:06:09] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 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 235 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2024-06-01 23:06:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-06-01 23:06:10] [INFO ] Computed 1 invariants in 59 ms
[2024-06-01 23:06:10] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-06-01 23:06:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:06:10] [INFO ] Invariant cache hit.
[2024-06-01 23:06:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:06:29] [INFO ] Implicit Places using invariants and state equation in 18980 ms returned []
Implicit Place search using SMT with State Equation took 19738 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:06:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:06:30] [INFO ] Invariant cache hit.
[2024-06-01 23:06:30] [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 30168 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 30107 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 90001ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 90133ms
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110195 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 12 out of 305 places after structural reductions.
[2024-06-01 23:08:00] [INFO ] Flatten gal took : 415 ms
[2024-06-01 23:08:00] [INFO ] Flatten gal took : 253 ms
[2024-06-01 23:08:01] [INFO ] Input system was already deterministic with 7936 transitions.
RANDOM walk for 40004 steps (8 resets) in 1959 ms. (20 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40003 steps (14 resets) in 227 ms. (175 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (14 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
[2024-06-01 23:08:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:08:02] [INFO ] Invariant cache hit.
[2024-06-01 23:08:02] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 300/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 2 solved, 2 unsolved in 804 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 302/305 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2500 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3343ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 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 416 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 420 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40012 steps (8 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 154894 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 154894 steps, saw 79042 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 23:08:09] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-06-01 23:08:09] [INFO ] Computed 2 invariants in 22 ms
[2024-06-01 23:08:09] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (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 677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:08:10] [INFO ] Deduced a trap composed of 84 places in 627 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:08:13] [INFO ] Deduced a trap composed of 169 places in 633 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3934 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 4679ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 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 200 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 200 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 299 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-06-01 23:08:14] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 23:08:14] [INFO ] Invariant cache hit.
[2024-06-01 23:08:15] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-06-01 23:08:15] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 23:08:15] [INFO ] Invariant cache hit.
[2024-06-01 23:08:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:08:39] [INFO ] Implicit Places using invariants and state equation in 24703 ms returned []
Implicit Place search using SMT with State Equation took 25207 ms to find 0 implicit places.
[2024-06-01 23:08:40] [INFO ] Redundant transitions in 871 ms returned []
Running 7807 sub problems to find dead transitions.
[2024-06-01 23:08:40] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-06-01 23:08:40] [INFO ] Invariant cache hit.
[2024-06-01 23:08:40] [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, 7807 unsolved
SMT process timed out in 58407ms, After SMT, problems are : Problem set: 0 solved, 7807 unsolved
Search for dead transitions found 0 dead transitions in 58479ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84889 ms. Remains : 305/305 places, 7809/7809 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 4 ms
Free SCC test removed 36 places
Drop transitions (Empty/Sink Transition effects.) removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 204 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1947 rows 269 cols
[2024-06-01 23:09:39] [INFO ] Computed 2 invariants in 14 ms
[2024-06-01 23:09:39] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 23:09:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 23:09:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 23:09:40] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 23:09:40] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-06-01 23:09:40] [INFO ] After 850ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 23:09:42] [INFO ] After 1929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 23:09:42] [INFO ] After 3350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 3682 ms.
FORMULA Szymanski-PT-b06-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
FORMULA Szymanski-PT-b06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(F(p0)))'
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-06-01 23:09:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-06-01 23:09:43] [INFO ] Computed 1 invariants in 22 ms
[2024-06-01 23:09:43] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-06-01 23:09:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:09:43] [INFO ] Invariant cache hit.
[2024-06-01 23:09:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:10:00] [INFO ] Implicit Places using invariants and state equation in 17336 ms returned []
Implicit Place search using SMT with State Equation took 17815 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:10:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:10:00] [INFO ] Invariant cache hit.
[2024-06-01 23:10:00] [INFO ] State equation strengthened by 147 read => feed constraints.
FORMULA Szymanski-PT-b06-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b06-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b06-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b06-LTLCardinality-03
FORMULA Szymanski-PT-b06-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b06-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b06-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b06-LTLCardinality-07
FORMULA Szymanski-PT-b06-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b06-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b06-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b06-LTLCardinality-11
FORMULA Szymanski-PT-b06-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b06-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b06-LTLCardinality-14
Could not compute solution for formula : Szymanski-PT-b06-LTLCardinality-15

BK_STOP 1717284544143

--------------------
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-b06-LTLCardinality-00
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.930 real 0.280 user 0.300 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 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): 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-b06-LTLCardinality-01
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.870 real 0.330 user 0.280 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_1_
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( 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: 3
pnml2lts-mc( 0/ 4): unique states count: 3
pnml2lts-mc( 0/ 4): unique transitions count: 2
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: 9
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9 states 12 transitions, fanout: 1.333
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, 109.3 B/state, compr.: 4.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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b06-LTLCardinality-02
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.320 user 0.270 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8325 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: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 10
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 21
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21 states 40 transitions, fanout: 1.905
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2100, Transitions per second: 4000
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, 78.2 B/state, compr.: 3.4%
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-b06-LTLCardinality-03
ltl formula formula --ltl=/tmp/584/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.880 real 0.290 user 0.320 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8344 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): ~557 levels ~10000 states ~54768 transitions
pnml2lts-mc( 2/ 4): ~481 levels ~20000 states ~117964 transitions
pnml2lts-mc( 1/ 4): ~855 levels ~40000 states ~231420 transitions
pnml2lts-mc( 1/ 4): ~855 levels ~80000 states ~503048 transitions
pnml2lts-mc( 3/ 4): ~1112 levels ~160000 states ~657656 transitions
pnml2lts-mc( 1/ 4): ~997 levels ~320000 states ~2114932 transitions
pnml2lts-mc( 1/ 4): ~997 levels ~640000 states ~4502536 transitions
pnml2lts-mc( 1/ 4): ~1095 levels ~1280000 states ~9431112 transitions
ltl formula name Szymanski-PT-b06-LTLCardinality-04
ltl formula formula --ltl=/tmp/584/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.930 real 0.330 user 0.280 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 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): 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-b06-LTLCardinality-05
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.320 user 0.290 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_5_
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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~42!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 160
pnml2lts-mc( 0/ 4): unique transitions count: 807
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: 165
pnml2lts-mc( 0/ 4): - cum. max stack depth: 165
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 165 states 825 transitions, fanout: 5.000
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4125, Transitions per second: 20625
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 43.7 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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b06-LTLCardinality-06
ltl formula formula --ltl=/tmp/584/ltl_6_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.870 real 0.280 user 0.290 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 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):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~50!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 209
pnml2lts-mc( 0/ 4): unique transitions count: 886
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: 215
pnml2lts-mc( 0/ 4): - cum. max stack depth: 215
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 215 states 906 transitions, fanout: 4.214
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5375, Transitions per second: 22650
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 44.4 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 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-b06-LTLCardinality-07
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.870 real 0.330 user 0.280 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_7_
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 8335 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): ~490 levels ~10000 states ~52964 transitions
pnml2lts-mc( 0/ 4): ~490 levels ~20000 states ~112600 transitions
pnml2lts-mc( 0/ 4): ~490 levels ~40000 states ~250916 transitions
pnml2lts-mc( 0/ 4): ~490 levels ~80000 states ~509812 transitions
pnml2lts-mc( 0/ 4): ~1120 levels ~160000 states ~1004852 transitions
pnml2lts-mc( 2/ 4): ~850 levels ~320000 states ~2299844 transitions
pnml2lts-mc( 2/ 4): ~850 levels ~640000 states ~4818424 transitions
pnml2lts-mc( 2/ 4): ~966 levels ~1280000 states ~9820800 transitions
ltl formula name Szymanski-PT-b06-LTLCardinality-08
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.920 real 0.330 user 0.290 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8358 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~47!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 205
pnml2lts-mc( 0/ 4): unique transitions count: 1120
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: 210
pnml2lts-mc( 0/ 4): - cum. max stack depth: 210
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 210 states 1138 transitions, fanout: 5.419
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4200, Transitions per second: 22760
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 43.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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b06-LTLCardinality-09
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.860 real 0.300 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_9_
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 8328 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~80!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 325
pnml2lts-mc( 0/ 4): unique transitions count: 1501
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: 332
pnml2lts-mc( 0/ 4): - cum. max stack depth: 332
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 332 states 1529 transitions, fanout: 4.605
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.060 sec minimum, 0.068 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4743, Transitions per second: 21843
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-b06-LTLCardinality-10
ltl formula formula --ltl=/tmp/584/ltl_10_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.830 real 0.340 user 0.240 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/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 8326 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 ~56!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 194
pnml2lts-mc( 0/ 4): unique transitions count: 909
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: 200
pnml2lts-mc( 0/ 4): - cum. max stack depth: 200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 200 states 937 transitions, fanout: 4.685
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.040 sec minimum, 0.042 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4000, Transitions per second: 18740
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 44.3 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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b06-LTLCardinality-11
ltl formula formula --ltl=/tmp/584/ltl_11_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 568 places, 8320 transitions and 33408 arcs
pnml2lts-mc( 0/ 4): Petri net Szymanski-PT-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.870 real 0.320 user 0.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 310 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8333 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): ~259 levels ~10000 states ~49868 transitions
pnml2lts-mc( 2/ 4): ~259 levels ~20000 states ~105368 transitions
pnml2lts-mc( 3/ 4): ~282 levels ~40000 states ~235432 transitions
pnml2lts-mc( 2/ 4): ~386 levels ~80000 states ~490140 transitions
pnml2lts-mc( 2/ 4): ~399 levels ~160000 states ~1030076 transitions
pnml2lts-mc( 2/ 4): ~446 levels ~320000 states ~2216184 transitions
pnml2lts-mc( 2/ 4): ~459 levels ~640000 states ~4758896 transitions
pnml2lts-mc( 2/ 4): ~459 levels ~1280000 states ~9702648 transitions
ltl formula name Szymanski-PT-b06-LTLCardinality-12
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.010 real 0.310 user 0.300 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_12_
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 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):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~72!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 272
pnml2lts-mc( 0/ 4): unique transitions count: 1356
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: 277
pnml2lts-mc( 0/ 4): - cum. max stack depth: 277
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 277 states 1374 transitions, fanout: 4.960
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: 4617, Transitions per second: 22900
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.4 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-b06-LTLCardinality-13
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.290 user 0.290 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/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): 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-b06-LTLCardinality-14
ltl formula formula --ltl=/tmp/584/ltl_14_
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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.840 real 0.300 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 569, there are 8340 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): ~667 levels ~10000 states ~38324 transitions
pnml2lts-mc( 2/ 4): ~667 levels ~20000 states ~87480 transitions
pnml2lts-mc( 2/ 4): ~667 levels ~40000 states ~203740 transitions
pnml2lts-mc( 1/ 4): ~7191 levels ~80000 states ~500148 transitions
pnml2lts-mc( 0/ 4): ~7991 levels ~160000 states ~662188 transitions
pnml2lts-mc( 0/ 4): ~16647 levels ~320000 states ~1650920 transitions
pnml2lts-mc( 3/ 4): ~1271 levels ~640000 states ~4560964 transitions
pnml2lts-mc( 0/ 4): ~33658 levels ~1280000 states ~7873608 transitions
ltl formula name Szymanski-PT-b06-LTLCardinality-15
ltl formula formula --ltl=/tmp/584/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-b06 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.910 real 0.290 user 0.310 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/584/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/584/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/584/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/584/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 6 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( 1/ 4): ~1253 levels ~10000 states ~55792 transitions
pnml2lts-mc( 1/ 4): ~1365 levels ~20000 states ~116748 transitions
pnml2lts-mc( 1/ 4): ~1406 levels ~40000 states ~249400 transitions
pnml2lts-mc( 2/ 4): ~1628 levels ~80000 states ~508016 transitions
pnml2lts-mc( 2/ 4): ~1628 levels ~160000 states ~1078364 transitions
pnml2lts-mc( 3/ 4): ~2466 levels ~320000 states ~2289028 transitions
pnml2lts-mc( 3/ 4): ~2466 levels ~640000 states ~4858672 transitions
pnml2lts-mc( 0/ 4): ~27852 levels ~1280000 states ~7981692 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-b06"
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-b06, 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-171690533300875"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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