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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 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-b08-LTLCardinality-00
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-01
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-02
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-03
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-04
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-05
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-06
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-07
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-08
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-09
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-10
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-11
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-12
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-13
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-14
FORMULA_NAME Szymanski-PT-b08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717283647095

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-b08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:14:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 23:14:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:14:08] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2024-06-01 23:14:08] [INFO ] Transformed 568 places.
[2024-06-01 23:14:08] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:14:08] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 485 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 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.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-b08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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
Applied a total of 2 rules in 155 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2024-06-01 23:14:09] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-06-01 23:14:09] [INFO ] Computed 1 invariants in 78 ms
[2024-06-01 23:14:09] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-06-01 23:14:09] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:14:09] [INFO ] Invariant cache hit.
[2024-06-01 23:14:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:14:40] [INFO ] Performed 270/306 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:14:52] [INFO ] Implicit Places using invariants and state equation in 42886 ms returned []
Implicit Place search using SMT with State Equation took 43683 ms to find 0 implicit places.
Running 8062 sub problems to find dead transitions.
[2024-06-01 23:14:52] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:14:52] [INFO ] Invariant cache hit.
[2024-06-01 23:14:52] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/3039 variables, and 1 constraints, problems are : Problem set: 0 solved, 8062 unsolved in 30189 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 8062/8062 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8062 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/3039 variables, and 1 constraints, problems are : Problem set: 0 solved, 8062 unsolved in 30094 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/8062 constraints, Known Traps: 0/0 constraints]
After SMT, in 90388ms problems are : Problem set: 0 solved, 8062 unsolved
Search for dead transitions found 0 dead transitions in 90503ms
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134399 ms. Remains : 306/308 places, 8064/8064 transitions.
Support contains 24 out of 306 places after structural reductions.
[2024-06-01 23:16:24] [INFO ] Flatten gal took : 538 ms
[2024-06-01 23:16:24] [INFO ] Flatten gal took : 280 ms
[2024-06-01 23:16:24] [INFO ] Input system was already deterministic with 8064 transitions.
RANDOM walk for 40006 steps (15 resets) in 1214 ms. (32 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40003 steps (14 resets) in 222 ms. (179 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 236 ms. (168 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 489 ms. (81 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
[2024-06-01 23:16:25] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:16:25] [INFO ] Invariant cache hit.
[2024-06-01 23:16:25] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 295/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3039/3039 variables, and 454 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1220 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 295/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 4/458 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3039 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/3039 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3039/3039 variables, and 458 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2503 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3766ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 2 properties in 765 ms.
Support contains 3 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 306 transition count 7938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 305 transition count 7810
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 305 transition count 7810
Applied a total of 128 rules in 425 ms. Remains 305 /306 variables (removed 1) and now considering 7810/8064 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 305/306 places, 7810/8064 transitions.
RANDOM walk for 40017 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 153089 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 153089 steps, saw 103083 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 23:16:34] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2024-06-01 23:16:34] [INFO ] Computed 1 invariants in 30 ms
[2024-06-01 23:16:34] [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) 302/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2606/2911 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2911 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2911 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/2911 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2911/2911 variables, and 453 constraints, problems are : Problem set: 0 solved, 2 unsolved in 866 ms.
Refiners :[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) 302/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:16:35] [INFO ] Deduced a trap composed of 57 places in 632 ms of which 20 ms to minimize.
[2024-06-01 23:16:36] [INFO ] Deduced a trap composed of 37 places in 674 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2606/2911 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2911 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2911 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:16:38] [INFO ] Deduced a trap composed of 74 places in 608 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2911 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2911 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2911 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2911/2911 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4319 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 5263ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 749 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 305 transition count 7808
Applied a total of 2 rules in 214 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7810 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 305/305 places, 7808/7810 transitions.
RANDOM walk for 40009 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 210072 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 210072 steps, saw 130644 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-06-01 23:16:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:16:43] [INFO ] Computed 3 invariants in 23 ms
[2024-06-01 23:16:43] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 23:16:43] [INFO ] Deduced a trap composed of 75 places in 489 ms of which 3 ms to minimize.
[2024-06-01 23:16:44] [INFO ] Deduced a trap composed of 91 places in 492 ms of which 3 ms to minimize.
[2024-06-01 23:16:44] [INFO ] Deduced a trap composed of 101 places in 478 ms of which 2 ms to minimize.
[2024-06-01 23:16:45] [INFO ] Deduced a trap composed of 129 places in 384 ms of which 2 ms to minimize.
[2024-06-01 23:16:45] [INFO ] Deduced a trap composed of 129 places in 376 ms of which 2 ms to minimize.
[2024-06-01 23:16:46] [INFO ] Deduced a trap composed of 79 places in 406 ms of which 3 ms to minimize.
[2024-06-01 23:16:46] [INFO ] Deduced a trap composed of 108 places in 369 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4087 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: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 23:16:47] [INFO ] Deduced a trap composed of 78 places in 289 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 464 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1936 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: 8/8 constraints]
After SMT, in 6085ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 1 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 324 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 324 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 199 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:16:50] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:16:50] [INFO ] Invariant cache hit.
[2024-06-01 23:16:50] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-06-01 23:16:50] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:16:50] [INFO ] Invariant cache hit.
[2024-06-01 23:16:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:17:11] [INFO ] Implicit Places using invariants and state equation in 21216 ms returned []
Implicit Place search using SMT with State Equation took 21860 ms to find 0 implicit places.
[2024-06-01 23:17:12] [INFO ] Redundant transitions in 892 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:17:12] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:17:12] [INFO ] Invariant cache hit.
[2024-06-01 23:17:12] [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 30111 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:18:15] [INFO ] Deduced a trap composed of 138 places in 402 ms of which 3 ms to minimize.
[2024-06-01 23:18:17] [INFO ] Deduced a trap composed of 48 places in 334 ms of which 2 ms to minimize.
[2024-06-01 23:18:17] [INFO ] Deduced a trap composed of 86 places in 317 ms of which 2 ms to minimize.
[2024-06-01 23:18:18] [INFO ] Deduced a trap composed of 70 places in 263 ms of which 2 ms to minimize.
[2024-06-01 23:18:18] [INFO ] Deduced a trap composed of 72 places in 261 ms of which 2 ms to minimize.
[2024-06-01 23:18:18] [INFO ] Deduced a trap composed of 77 places in 297 ms of which 2 ms to minimize.
[2024-06-01 23:18:19] [INFO ] Deduced a trap composed of 72 places in 303 ms of which 2 ms to minimize.
[2024-06-01 23:18:19] [INFO ] Deduced a trap composed of 85 places in 295 ms of which 1 ms to minimize.
[2024-06-01 23:18:20] [INFO ] Deduced a trap composed of 99 places in 462 ms of which 2 ms to minimize.
[2024-06-01 23:18:20] [INFO ] Deduced a trap composed of 50 places in 368 ms of which 2 ms to minimize.
[2024-06-01 23:18:20] [INFO ] Deduced a trap composed of 78 places in 437 ms of which 3 ms to minimize.
[2024-06-01 23:18:21] [INFO ] Deduced a trap composed of 107 places in 435 ms of which 2 ms to minimize.
[2024-06-01 23:18:21] [INFO ] Deduced a trap composed of 132 places in 337 ms of which 2 ms to minimize.
[2024-06-01 23:18:22] [INFO ] Deduced a trap composed of 77 places in 419 ms of which 2 ms to minimize.
[2024-06-01 23:18:22] [INFO ] Deduced a trap composed of 122 places in 341 ms of which 2 ms to minimize.
[2024-06-01 23:18:22] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 1 ms to minimize.
[2024-06-01 23:18:23] [INFO ] Deduced a trap composed of 72 places in 362 ms of which 4 ms to minimize.
[2024-06-01 23:18:23] [INFO ] Deduced a trap composed of 122 places in 340 ms of which 2 ms to minimize.
[2024-06-01 23:18:23] [INFO ] Deduced a trap composed of 134 places in 238 ms of which 1 ms to minimize.
[2024-06-01 23:18:27] [INFO ] Deduced a trap composed of 135 places in 468 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:18:32] [INFO ] Deduced a trap composed of 195 places in 205 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 24 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30114 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: 21/21 constraints]
After SMT, in 89150ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 89224ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112198 ms. Remains : 305/305 places, 7808/7808 transitions.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA Szymanski-PT-b08-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 2432 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 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 480 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-06-01 23:18:42] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-06-01 23:18:42] [INFO ] Computed 1 invariants in 22 ms
[2024-06-01 23:18:43] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-06-01 23:18:43] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:18:43] [INFO ] Invariant cache hit.
[2024-06-01 23:18:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:19:14] [INFO ] Performed 297/306 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:19:16] [INFO ] Implicit Places using invariants and state equation in 32676 ms returned []
Implicit Place search using SMT with State Equation took 33156 ms to find 0 implicit places.
[2024-06-01 23:19:16] [INFO ] Redundant transitions in 665 ms returned []
Running 8062 sub problems to find dead transitions.
[2024-06-01 23:19:16] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:19:16] [INFO ] Invariant cache hit.
[2024-06-01 23:19:16] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/3039 variables, and 1 constraints, problems are : Problem set: 0 solved, 8062 unsolved in 30110 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 8062/8062 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8062 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/3039 variables, and 1 constraints, problems are : Problem set: 0 solved, 8062 unsolved in 30097 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/8062 constraints, Known Traps: 0/0 constraints]
After SMT, in 91563ms problems are : Problem set: 0 solved, 8062 unsolved
Search for dead transitions found 0 dead transitions in 91630ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 125963 ms. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLCardinality-00
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 9 ms.
FORMULA Szymanski-PT-b08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLCardinality-00 finished in 126224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 221 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-06-01 23:20:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-06-01 23:20:48] [INFO ] Computed 1 invariants in 21 ms
[2024-06-01 23:20:49] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-06-01 23:20:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:20:49] [INFO ] Invariant cache hit.
[2024-06-01 23:20:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:21:21] [INFO ] Performed 304/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 23:21:21] [INFO ] Implicit Places using invariants and state equation in 31776 ms returned []
Implicit Place search using SMT with State Equation took 32231 ms to find 0 implicit places.
[2024-06-01 23:21:21] [INFO ] Redundant transitions in 856 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:21:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:21:21] [INFO ] Invariant cache hit.
[2024-06-01 23:21:21] [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 30109 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 30118 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 88522ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 88591ms
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121925 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLCardinality-01
Product exploration explored 100000 steps with 1 reset in 461 ms.
Product exploration explored 100000 steps with 31 reset in 412 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 77 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 27 ms :[(NOT p0)]
RANDOM walk for 40004 steps (11 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 213051 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 213051 steps, saw 144715 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-06-01 23:22:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:22:54] [INFO ] Invariant cache hit.
[2024-06-01 23:22:54] [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) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2335 ms.
Refiners :[Generalized P Invariants (flows): 1/1 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) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5178 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 7550ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 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 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 204 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 305/305 places, 7808/7936 transitions.
RANDOM walk for 40016 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 221279 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 221279 steps, saw 133816 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 23:23:05] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:23:05] [INFO ] Computed 3 invariants in 20 ms
[2024-06-01 23:23:05] [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) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (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 643 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) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 23:23:06] [INFO ] Deduced a trap composed of 72 places in 519 ms of which 21 ms to minimize.
[2024-06-01 23:23:07] [INFO ] Deduced a trap composed of 75 places in 664 ms of which 6 ms to minimize.
[2024-06-01 23:23:08] [INFO ] Deduced a trap composed of 129 places in 506 ms of which 16 ms to minimize.
[2024-06-01 23:23:08] [INFO ] Deduced a trap composed of 131 places in 490 ms of which 9 ms to minimize.
[2024-06-01 23:23:09] [INFO ] Deduced a trap composed of 129 places in 630 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 460 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11236 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 12120ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 125 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 187 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 189 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 177 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:23:18] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:23:18] [INFO ] Invariant cache hit.
[2024-06-01 23:23:18] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-06-01 23:23:18] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:23:18] [INFO ] Invariant cache hit.
[2024-06-01 23:23:19] [INFO ] State equation strengthened by 147 read => feed constraints.
FORMULA Szymanski-PT-b08-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b08-LTLCardinality-01
FORMULA Szymanski-PT-b08-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b08-LTLCardinality-03
FORMULA Szymanski-PT-b08-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b08-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b08-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b08-LTLCardinality-07
Could not compute solution for formula : Szymanski-PT-b08-LTLCardinality-08
FORMULA Szymanski-PT-b08-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b08-LTLCardinality-10
FORMULA Szymanski-PT-b08-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Szymanski-PT-b08-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b08-LTLCardinality-13
FORMULA Szymanski-PT-b08-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Szymanski-PT-b08-LTLCardinality-15

BK_STOP 1717285805122

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Szymanski-PT-b08-LTLCardinality-00
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.560 real 0.310 user 0.310 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 309 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( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~100!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 283
pnml2lts-mc( 0/ 4): unique transitions count: 1216
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: 289
pnml2lts-mc( 0/ 4): - cum. max stack depth: 289
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 289 states 1237 transitions, fanout: 4.280
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.060 sec minimum, 0.075 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3612, Transitions per second: 15462
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.5 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-b08-LTLCardinality-01
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.740 real 0.340 user 0.320 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_1_
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( 3/ 4): ~887 levels ~10000 states ~49036 transitions
pnml2lts-mc( 3/ 4): ~887 levels ~20000 states ~105848 transitions
pnml2lts-mc( 1/ 4): ~895 levels ~40000 states ~161176 transitions
pnml2lts-mc( 1/ 4): ~939 levels ~80000 states ~319260 transitions
pnml2lts-mc( 1/ 4): ~939 levels ~160000 states ~642676 transitions
pnml2lts-mc( 1/ 4): ~939 levels ~320000 states ~1278756 transitions
pnml2lts-mc( 1/ 4): ~959 levels ~640000 states ~2657288 transitions
pnml2lts-mc( 1/ 4): ~50343 levels ~1280000 states ~5785960 transitions
ltl formula name Szymanski-PT-b08-LTLCardinality-02
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.900 real 0.310 user 0.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_2_
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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~76!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 292
pnml2lts-mc( 0/ 4): unique transitions count: 1448
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: 298
pnml2lts-mc( 0/ 4): - cum. max stack depth: 298
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 298 states 1476 transitions, fanout: 4.953
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: 4257, Transitions per second: 21086
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 45.6 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 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-b08-LTLCardinality-03
ltl formula formula --ltl=/tmp/779/ltl_3_
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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.830 real 0.270 user 0.260 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 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): ~940 levels ~10000 states ~54092 transitions
pnml2lts-mc( 3/ 4): ~940 levels ~20000 states ~115652 transitions
pnml2lts-mc( 3/ 4): ~940 levels ~40000 states ~248556 transitions
pnml2lts-mc( 1/ 4): ~3465 levels ~80000 states ~564348 transitions
pnml2lts-mc( 1/ 4): ~3465 levels ~160000 states ~1198940 transitions
pnml2lts-mc( 1/ 4): ~3465 levels ~320000 states ~2516352 transitions
pnml2lts-mc( 0/ 4): ~29982 levels ~640000 states ~4536928 transitions
pnml2lts-mc( 0/ 4): ~30003 levels ~1280000 states ~9627084 transitions
ltl formula name Szymanski-PT-b08-LTLCardinality-04
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.930 real 0.290 user 0.270 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_4_
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 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( 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.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 900, Transitions per second: 1200
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-b08-LTLCardinality-05
ltl formula formula --ltl=/tmp/779/ltl_5_
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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.850 real 0.250 user 0.300 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_5_
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 8321 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 ~73!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 311
pnml2lts-mc( 0/ 4): unique transitions count: 1651
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: 317
pnml2lts-mc( 0/ 4): - cum. max stack depth: 317
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 317 states 1673 transitions, fanout: 5.278
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: 4529, Transitions per second: 23900
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.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-b08-LTLCardinality-06
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.870 real 0.270 user 0.270 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/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 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): 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-b08-LTLCardinality-07
ltl formula formula --ltl=/tmp/779/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-b08 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.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_7_
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 8336 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): ~1276 levels ~10000 states ~109540 transitions
pnml2lts-mc( 1/ 4): ~1578 levels ~20000 states ~233276 transitions
pnml2lts-mc( 1/ 4): ~1578 levels ~40000 states ~488172 transitions
pnml2lts-mc( 1/ 4): ~1578 levels ~80000 states ~998188 transitions
pnml2lts-mc( 1/ 4): ~1578 levels ~160000 states ~2099396 transitions
pnml2lts-mc( 0/ 4): ~25724 levels ~320000 states ~3721108 transitions
pnml2lts-mc( 2/ 4): ~36144 levels ~640000 states ~6427908 transitions
pnml2lts-mc( 2/ 4): ~36144 levels ~1280000 states ~12114900 transitions
ltl formula name Szymanski-PT-b08-LTLCardinality-08
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.890 real 0.330 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_8_
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 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( 1/ 4): ~1731 levels ~10000 states ~53816 transitions
pnml2lts-mc( 1/ 4): ~1731 levels ~20000 states ~116536 transitions
pnml2lts-mc( 2/ 4): ~731 levels ~40000 states ~249984 transitions
pnml2lts-mc( 3/ 4): ~2839 levels ~80000 states ~507332 transitions
pnml2lts-mc( 3/ 4): ~2839 levels ~160000 states ~1076676 transitions
pnml2lts-mc( 3/ 4): ~2864 levels ~320000 states ~2232148 transitions
pnml2lts-mc( 3/ 4): ~3005 levels ~640000 states ~4674056 transitions
pnml2lts-mc( 3/ 4): ~3054 levels ~1280000 states ~9822616 transitions
ltl formula name Szymanski-PT-b08-LTLCardinality-09
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.960 real 0.300 user 0.240 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_9_
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: 5
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 4
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 15
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15 states 20 transitions, fanout: 1.333
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: 1500, Transitions per second: 2000
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, 92.8 B/state, compr.: 4.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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b08-LTLCardinality-10
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.850 real 0.250 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 309 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( 2/ 4): ~938 levels ~10000 states ~56184 transitions
pnml2lts-mc( 2/ 4): ~1011 levels ~20000 states ~118360 transitions
pnml2lts-mc( 2/ 4): ~1011 levels ~40000 states ~257764 transitions
pnml2lts-mc( 1/ 4): ~891 levels ~80000 states ~519744 transitions
pnml2lts-mc( 1/ 4): ~891 levels ~160000 states ~1097552 transitions
pnml2lts-mc( 1/ 4): ~891 levels ~320000 states ~2281664 transitions
pnml2lts-mc( 1/ 4): ~1148 levels ~640000 states ~4785868 transitions
pnml2lts-mc( 3/ 4): ~7717 levels ~1280000 states ~9342696 transitions
ltl formula name Szymanski-PT-b08-LTLCardinality-11
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.880 real 0.240 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/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 8339 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 ~76!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 317
pnml2lts-mc( 0/ 4): unique transitions count: 1533
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: 323
pnml2lts-mc( 0/ 4): - cum. max stack depth: 323
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 323 states 1555 transitions, fanout: 4.814
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: 4038, Transitions per second: 19438
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.5 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-b08-LTLCardinality-12
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.860 real 0.270 user 0.280 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_12_
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 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( 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-b08-LTLCardinality-13
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.850 real 0.310 user 0.250 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_13_
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( 0/ 4): ~819 levels ~10000 states ~104836 transitions
pnml2lts-mc( 0/ 4): ~819 levels ~20000 states ~221516 transitions
pnml2lts-mc( 0/ 4): ~819 levels ~40000 states ~462804 transitions
pnml2lts-mc( 0/ 4): ~819 levels ~80000 states ~1002860 transitions
pnml2lts-mc( 0/ 4): ~819 levels ~160000 states ~2125364 transitions
pnml2lts-mc( 0/ 4): ~819 levels ~320000 states ~4370244 transitions
pnml2lts-mc( 1/ 4): ~1190 levels ~640000 states ~8850068 transitions
pnml2lts-mc( 3/ 4): ~92341 levels ~1280000 states ~17426164 transitions
ltl formula name Szymanski-PT-b08-LTLCardinality-14
ltl formula formula --ltl=/tmp/779/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-b08 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.270 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 10 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 8343 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 ~54!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 230
pnml2lts-mc( 0/ 4): unique transitions count: 1164
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: 235
pnml2lts-mc( 0/ 4): - cum. max stack depth: 235
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 235 states 1182 transitions, fanout: 5.030
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.040 sec minimum, 0.045 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4700, Transitions per second: 23640
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 41.3 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.0MB (~256.0MB paged-in)
ltl formula name Szymanski-PT-b08-LTLCardinality-15
ltl formula formula --ltl=/tmp/779/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-b08 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.850 real 0.300 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/779/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/779/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/779/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/779/ltl_15_
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( 3/ 4): ~319 levels ~10000 states ~51616 transitions
pnml2lts-mc( 3/ 4): ~319 levels ~20000 states ~104860 transitions
pnml2lts-mc( 3/ 4): ~319 levels ~40000 states ~229528 transitions
pnml2lts-mc( 3/ 4): ~319 levels ~80000 states ~467172 transitions
pnml2lts-mc( 3/ 4): ~2227 levels ~160000 states ~972988 transitions
pnml2lts-mc( 0/ 4): ~2169 levels ~320000 states ~2175684 transitions
pnml2lts-mc( 3/ 4): ~2686 levels ~640000 states ~4643432 transitions
pnml2lts-mc( 3/ 4): ~2686 levels ~1280000 states ~9835016 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-b08"
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-b08, 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-171690533400883"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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