Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446800315.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M 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 PolyORBLF-PT-S06J04T04-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717255251649

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:20:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:20:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:20:53] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2024-06-01 15:20:53] [INFO ] Transformed 454 places.
[2024-06-01 15:20:53] [INFO ] Transformed 6994 transitions.
[2024-06-01 15:20:53] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 445 transition count 1611
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 445 transition count 1611
Applied a total of 12 rules in 103 ms. Remains 445 /454 variables (removed 9) and now considering 1611/1614 (removed 3) transitions.
Running 1605 sub problems to find dead transitions.
[2024-06-01 15:20:53] [INFO ] Flow matrix only has 1587 transitions (discarded 24 similar events)
// Phase 1: matrix 1587 rows 445 cols
[2024-06-01 15:20:54] [INFO ] Computed 44 invariants in 108 ms
[2024-06-01 15:20:54] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
[2024-06-01 15:21:22] [INFO ] Deduced a trap composed of 104 places in 327 ms of which 32 ms to minimize.
[2024-06-01 15:21:23] [INFO ] Deduced a trap composed of 207 places in 371 ms of which 4 ms to minimize.
[2024-06-01 15:21:24] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 4 ms to minimize.
[2024-06-01 15:21:24] [INFO ] Deduced a trap composed of 199 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:21:25] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:21:25] [INFO ] Deduced a trap composed of 203 places in 337 ms of which 3 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 207 places in 306 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/2032 variables, and 44 constraints, problems are : Problem set: 0 solved, 1605 unsolved in 20108 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 24/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1605/1605 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
[2024-06-01 15:21:34] [INFO ] Deduced a trap composed of 80 places in 312 ms of which 2 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 187 places in 302 ms of which 3 ms to minimize.
[2024-06-01 15:21:46] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:21:46] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:21:46] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/2032 variables, and 49 constraints, problems are : Problem set: 0 solved, 1605 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 24/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1605 constraints, Known Traps: 12/12 constraints]
After SMT, in 56375ms problems are : Problem set: 0 solved, 1605 unsolved
Search for dead transitions found 0 dead transitions in 56420ms
[2024-06-01 15:21:50] [INFO ] Flow matrix only has 1587 transitions (discarded 24 similar events)
[2024-06-01 15:21:50] [INFO ] Invariant cache hit.
[2024-06-01 15:21:50] [INFO ] Implicit Places using invariants in 570 ms returned [42, 285, 345, 405]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 591 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 441/454 places, 1611/1614 transitions.
Applied a total of 0 rules in 25 ms. Remains 441 /441 variables (removed 0) and now considering 1611/1611 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57192 ms. Remains : 441/454 places, 1611/1614 transitions.
Support contains 99 out of 441 places after structural reductions.
[2024-06-01 15:21:51] [INFO ] Flatten gal took : 229 ms
[2024-06-01 15:21:51] [INFO ] Flatten gal took : 122 ms
[2024-06-01 15:21:51] [INFO ] Input system was already deterministic with 1611 transitions.
RANDOM walk for 40000 steps (202 resets) in 2669 ms. (14 steps per ms) remains 12/28 properties
BEST_FIRST walk for 40001 steps (93 resets) in 262 ms. (152 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (139 resets) in 511 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 375 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 284 ms. (140 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (123 resets) in 243 ms. (163 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (84 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (108 resets) in 235 ms. (169 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (105 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (84 resets) in 211 ms. (188 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (100 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (84 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (89 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
[2024-06-01 15:21:53] [INFO ] Flow matrix only has 1587 transitions (discarded 24 similar events)
// Phase 1: matrix 1587 rows 441 cols
[2024-06-01 15:21:53] [INFO ] Computed 40 invariants in 35 ms
[2024-06-01 15:21:53] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (OVERLAPS) 63/112 variables, 9/10 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 58/170 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 10/180 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 8 (OVERLAPS) 254/434 variables, 20/35 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/35 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/435 variables, 1/36 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/36 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/441 variables, 4/40 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1587/2028 variables, 441/481 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2028 variables, 112/593 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2028 variables, 0/593 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2028 variables, 0/593 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2028/2028 variables, and 593 constraints, problems are : Problem set: 8 solved, 4 unsolved in 1787 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 441/441 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/101 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 58/159 variables, 3/11 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/169 variables, 2/13 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 262/431 variables, 19/32 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:21:56] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:21:56] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 3/35 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/35 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/434 variables, 3/38 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/38 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 7/441 variables, 5/43 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-06-01 15:21:56] [INFO ] Deduced a trap composed of 79 places in 475 ms of which 4 ms to minimize.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Int declared 441/2028 variables, and 44 constraints, problems are : Problem set: 12 solved, 0 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/441 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 4/4 constraints]
After SMT, in 3314ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 1611/1611 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 441 transition count 1581
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 411 transition count 1581
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 60 place count 411 transition count 1533
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 156 place count 363 transition count 1533
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 362 transition count 1532
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 362 transition count 1532
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 260 place count 311 transition count 1481
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 263 place count 308 transition count 1478
Iterating global reduction 2 with 3 rules applied. Total rules applied 266 place count 308 transition count 1478
Applied a total of 266 rules in 212 ms. Remains 308 /441 variables (removed 133) and now considering 1478/1611 (removed 133) transitions.
Running 1472 sub problems to find dead transitions.
[2024-06-01 15:21:57] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
// Phase 1: matrix 1454 rows 308 cols
[2024-06-01 15:21:57] [INFO ] Computed 40 invariants in 24 ms
[2024-06-01 15:21:57] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 15:22:19] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 3 ms to minimize.
[2024-06-01 15:22:19] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 2 ms to minimize.
[2024-06-01 15:22:21] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2024-06-01 15:22:29] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:22:29] [INFO ] Deduced a trap composed of 90 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:22:30] [INFO ] Deduced a trap composed of 77 places in 307 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 39 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 15:22:33] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:22:33] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 42 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 9/9 constraints]
After SMT, in 53522ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 53537ms
[2024-06-01 15:22:51] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 15:22:51] [INFO ] Invariant cache hit.
[2024-06-01 15:22:51] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-06-01 15:22:51] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 15:22:51] [INFO ] Invariant cache hit.
[2024-06-01 15:22:52] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:23:00] [INFO ] Implicit Places using invariants and state equation in 8992 ms returned []
Implicit Place search using SMT with State Equation took 9445 ms to find 0 implicit places.
[2024-06-01 15:23:00] [INFO ] Redundant transitions in 122 ms returned []
Running 1472 sub problems to find dead transitions.
[2024-06-01 15:23:00] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 15:23:00] [INFO ] Invariant cache hit.
[2024-06-01 15:23:00] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 15:23:20] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:23:20] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2024-06-01 15:23:21] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 1 ms to minimize.
[2024-06-01 15:23:31] [INFO ] Deduced a trap composed of 90 places in 287 ms of which 2 ms to minimize.
[2024-06-01 15:23:31] [INFO ] Deduced a trap composed of 77 places in 277 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
SMT process timed out in 43032ms, After SMT, problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 43054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/441 places, 1478/1611 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106388 ms. Remains : 308/441 places, 1478/1611 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLCardinality-03
Stuttering criterion allowed to conclude after 363 steps with 7 reset in 15 ms.
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T04-LTLCardinality-03 finished in 106696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 1611/1611 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 441 transition count 1581
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 411 transition count 1581
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 60 place count 411 transition count 1533
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 156 place count 363 transition count 1533
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 362 transition count 1532
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 362 transition count 1532
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 260 place count 311 transition count 1481
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 263 place count 308 transition count 1478
Iterating global reduction 2 with 3 rules applied. Total rules applied 266 place count 308 transition count 1478
Applied a total of 266 rules in 199 ms. Remains 308 /441 variables (removed 133) and now considering 1478/1611 (removed 133) transitions.
Running 1472 sub problems to find dead transitions.
[2024-06-01 15:23:44] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 15:23:44] [INFO ] Invariant cache hit.
[2024-06-01 15:23:44] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 15:24:09] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 1 ms to minimize.
[2024-06-01 15:24:09] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:24:10] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 1 ms to minimize.
[2024-06-01 15:24:19] [INFO ] Deduced a trap composed of 90 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:24:20] [INFO ] Deduced a trap composed of 77 places in 320 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 38 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 15:24:24] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:24:25] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 40 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 7/7 constraints]
After SMT, in 57656ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 57678ms
[2024-06-01 15:24:41] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 15:24:41] [INFO ] Invariant cache hit.
[2024-06-01 15:24:42] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-06-01 15:24:42] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 15:24:42] [INFO ] Invariant cache hit.
[2024-06-01 15:24:42] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:24:50] [INFO ] Implicit Places using invariants and state equation in 7862 ms returned []
Implicit Place search using SMT with State Equation took 8337 ms to find 0 implicit places.
[2024-06-01 15:24:50] [INFO ] Redundant transitions in 27 ms returned []
Running 1472 sub problems to find dead transitions.
[2024-06-01 15:24:50] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 15:24:50] [INFO ] Invariant cache hit.
[2024-06-01 15:24:50] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 15:25:12] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 2 ms to minimize.
[2024-06-01 15:25:12] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:25:13] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:25:24] [INFO ] Deduced a trap composed of 90 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:25:24] [INFO ] Deduced a trap composed of 77 places in 224 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 38 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 15:25:36] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:25:36] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
At refinement iteration 5 (OVERLAPS) 3/305 variables, 3/43 constraints. Problems are: Problem set: 231 solved, 1241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/1762 variables, and 43 constraints, problems are : Problem set: 231 solved, 1241 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 7/7 constraints]
After SMT, in 73795ms problems are : Problem set: 231 solved, 1241 unsolved
Search for dead transitions found 231 dead transitions in 73807ms
Found 231 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 231 transitions
Dead transitions reduction (with SMT) removed 231 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 308/441 places, 1247/1611 transitions.
Applied a total of 0 rules in 21 ms. Remains 308 /308 variables (removed 0) and now considering 1247/1247 (removed 0) transitions.
[2024-06-01 15:26:04] [INFO ] Redundant transitions in 70 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 140166 ms. Remains : 308/441 places, 1247/1611 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLCardinality-06
Stuttering criterion allowed to conclude after 137 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T04-LTLCardinality-06 finished in 140304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||X((p2||F(p3))))))'
Support contains 18 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 1611/1611 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 437 transition count 1607
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 437 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 436 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 436 transition count 1606
Applied a total of 10 rules in 43 ms. Remains 436 /441 variables (removed 5) and now considering 1606/1611 (removed 5) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 15:26:04] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 436 cols
[2024-06-01 15:26:04] [INFO ] Computed 40 invariants in 21 ms
[2024-06-01 15:26:04] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 15:26:27] [INFO ] Deduced a trap composed of 178 places in 274 ms of which 2 ms to minimize.
[2024-06-01 15:26:28] [INFO ] Deduced a trap composed of 99 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:26:30] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2024-06-01 15:26:30] [INFO ] Deduced a trap composed of 195 places in 240 ms of which 2 ms to minimize.
[2024-06-01 15:26:30] [INFO ] Deduced a trap composed of 198 places in 275 ms of which 3 ms to minimize.
[2024-06-01 15:26:36] [INFO ] Deduced a trap composed of 74 places in 213 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 44 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 15:26:52] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 1 ms to minimize.
[2024-06-01 15:26:52] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 4 ms to minimize.
[2024-06-01 15:26:54] [INFO ] Deduced a trap composed of 217 places in 294 ms of which 3 ms to minimize.
[2024-06-01 15:26:54] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 18/23 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 15/15 constraints]
After SMT, in 54069ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 54082ms
[2024-06-01 15:26:58] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 15:26:58] [INFO ] Invariant cache hit.
[2024-06-01 15:26:58] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-06-01 15:26:58] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 15:26:58] [INFO ] Invariant cache hit.
[2024-06-01 15:26:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:27:08] [INFO ] Implicit Places using invariants and state equation in 10015 ms returned []
Implicit Place search using SMT with State Equation took 10490 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-06-01 15:27:08] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 15:27:08] [INFO ] Invariant cache hit.
[2024-06-01 15:27:08] [INFO ] State equation strengthened by 112 read => feed constraints.
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-LTLCardinality-01
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-LTLCardinality-13
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256113438

--------------------
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 PolyORBLF-PT-S06J04T04-LTLCardinality-00
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.440 real 0.330 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6996 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 ~61!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 190
pnml2lts-mc( 0/ 4): unique transitions count: 627
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 194
pnml2lts-mc( 0/ 4): - cum. max stack depth: 194
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 194 states 655 transitions, fanout: 3.376
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.040 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3233, Transitions per second: 10917
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, 56.7 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-01
ltl formula formula --ltl=/tmp/826/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.270 real 0.340 user 0.190 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_1_
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 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7000 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): ~127 levels ~10000 states ~24192 transitions
pnml2lts-mc( 0/ 4): ~127 levels ~20000 states ~48320 transitions
pnml2lts-mc( 0/ 4): ~127 levels ~40000 states ~99636 transitions
pnml2lts-mc( 0/ 4): ~127 levels ~80000 states ~200476 transitions
pnml2lts-mc( 0/ 4): ~366 levels ~160000 states ~432712 transitions
pnml2lts-mc( 1/ 4): ~8341 levels ~320000 states ~867324 transitions
pnml2lts-mc( 3/ 4): ~37824 levels ~640000 states ~1937608 transitions
pnml2lts-mc( 1/ 4): ~63221 levels ~1280000 states ~3414400 transitions
ltl formula name PolyORBLF-PT-S06J04T04-LTLCardinality-02
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.450 real 0.310 user 0.270 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6997 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 ~61!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 229
pnml2lts-mc( 0/ 4): unique transitions count: 662
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 233
pnml2lts-mc( 0/ 4): - cum. max stack depth: 233
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 233 states 690 transitions, fanout: 2.961
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.035 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5825, Transitions per second: 17250
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, 57.5 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-03
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.450 real 0.310 user 0.250 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/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 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7000 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 ~61!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 271
pnml2lts-mc( 0/ 4): unique transitions count: 806
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 274
pnml2lts-mc( 0/ 4): - cum. max stack depth: 274
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 274 states 828 transitions, fanout: 3.022
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.040 sec minimum, 0.047 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5480, Transitions per second: 16560
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, 55.8 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-04
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.600 real 0.350 user 0.330 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_4_
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 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6996 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, 600.0 B/state, compr.: 32.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-05
ltl formula formula --ltl=/tmp/826/ltl_5_
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.300 real 0.310 user 0.310 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7005 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.010 sec (0.000 sec minimum, 0.002 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
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, 600.0 B/state, compr.: 32.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-06
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 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.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7016 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 ~61!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6
pnml2lts-mc( 0/ 4): unique states count: 174
pnml2lts-mc( 0/ 4): unique transitions count: 604
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 178
pnml2lts-mc( 0/ 4): - cum. max stack depth: 172
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 178 states 650 transitions, fanout: 3.652
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5933, Transitions per second: 21667
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, 55.6 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-07
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.260 real 0.310 user 0.340 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7014 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 ~28!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 94
pnml2lts-mc( 0/ 4): unique transitions count: 296
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 97
pnml2lts-mc( 0/ 4): - cum. max stack depth: 97
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 97 states 318 transitions, fanout: 3.278
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.010 sec minimum, 0.022 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3233, Transitions per second: 10600
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, 61.0 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-08
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_8_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.740 real 0.370 user 0.270 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7009 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 ~38!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 197
pnml2lts-mc( 0/ 4): unique transitions count: 1051
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 200
pnml2lts-mc( 0/ 4): - cum. max stack depth: 200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 200 states 1073 transitions, fanout: 5.365
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.030 sec minimum, 0.045 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4000, Transitions per second: 21460
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 39.6 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-09
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.410 real 0.300 user 0.290 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_9_
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 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7000 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 ~205!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 604
pnml2lts-mc( 0/ 4): unique transitions count: 1363
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 608
pnml2lts-mc( 0/ 4): - cum. max stack depth: 608
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 608 states 1391 transitions, fanout: 2.288
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.110 sec minimum, 0.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5527, Transitions per second: 12645
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 51.6 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-10
ltl formula formula --ltl=/tmp/826/ltl_10_
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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.300 real 0.340 user 0.240 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/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 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6998 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 ~94!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 477
pnml2lts-mc( 0/ 4): unique transitions count: 1307
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 480
pnml2lts-mc( 0/ 4): - cum. max stack depth: 480
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 480 states 1329 transitions, fanout: 2.769
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.100 sec minimum, 0.108 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4364, Transitions per second: 12082
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, 53.1 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-11
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.560 real 0.350 user 0.310 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7004 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 ~37!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 84
pnml2lts-mc( 0/ 4): unique transitions count: 266
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 87
pnml2lts-mc( 0/ 4): - cum. max stack depth: 87
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 87 states 288 transitions, fanout: 3.310
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.000 sec minimum, 0.012 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4350, Transitions per second: 14400
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, 67.2 B/state, compr.: 3.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-12
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.310 real 0.310 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7005 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 ~37!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17
pnml2lts-mc( 0/ 4): unique states count: 171
pnml2lts-mc( 0/ 4): unique transitions count: 499
pnml2lts-mc( 0/ 4): - self-loop count: 5
pnml2lts-mc( 0/ 4): - claim dead count: 53
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 174
pnml2lts-mc( 0/ 4): - cum. max stack depth: 157
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 174 states 539 transitions, fanout: 3.098
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.020 sec minimum, 0.035 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4350, Transitions per second: 13475
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, 58.3 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-13
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.410 real 0.320 user 0.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7030 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): ~231 levels ~10000 states ~93284 transitions
pnml2lts-mc( 2/ 4): ~231 levels ~20000 states ~205708 transitions
pnml2lts-mc( 2/ 4): ~426 levels ~40000 states ~413648 transitions
pnml2lts-mc( 2/ 4): ~698 levels ~80000 states ~851296 transitions
pnml2lts-mc( 2/ 4): ~2797 levels ~160000 states ~1701852 transitions
pnml2lts-mc( 3/ 4): ~3746 levels ~320000 states ~2929904 transitions
pnml2lts-mc( 1/ 4): ~11267 levels ~640000 states ~5124792 transitions
pnml2lts-mc( 3/ 4): ~24377 levels ~1280000 states ~10154760 transitions
ltl formula name PolyORBLF-PT-S06J04T04-LTLCardinality-14
ltl formula formula --ltl=/tmp/826/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 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 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.260 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_14_
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 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6998 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 ~61!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 161
pnml2lts-mc( 0/ 4): unique transitions count: 471
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 164
pnml2lts-mc( 0/ 4): - cum. max stack depth: 164
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 164 states 493 transitions, fanout: 3.006
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: 4100, Transitions per second: 12325
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, 59.6 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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 PolyORBLF-PT-S06J04T04-LTLCardinality-15
ltl formula formula --ltl=/tmp/826/ltl_15_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.910 real 0.380 user 0.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/826/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/826/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/826/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/826/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6996 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 ~61!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 225
pnml2lts-mc( 0/ 4): unique transitions count: 730
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 229
pnml2lts-mc( 0/ 4): - cum. max stack depth: 229
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 229 states 758 transitions, fanout: 3.310
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7633, Transitions per second: 25267
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, 57.2 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 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)

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="PolyORBLF-PT-S06J04T04"
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 PolyORBLF-PT-S06J04T04, 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 r516-tajo-171654446800315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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