Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690531600099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyCommit-PT-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531600099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 231K 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 StigmergyCommit-PT-02b-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717228122247

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:48:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:48:43] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-01 07:48:43] [INFO ] Transformed 928 places.
[2024-06-01 07:48:43] [INFO ] Transformed 1040 transitions.
[2024-06-01 07:48:43] [INFO ] Found NUPN structural information;
[2024-06-01 07:48:43] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-02b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 857 transition count 969
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 857 transition count 969
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 185 place count 814 transition count 926
Iterating global reduction 0 with 43 rules applied. Total rules applied 228 place count 814 transition count 926
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 251 place count 791 transition count 903
Iterating global reduction 0 with 23 rules applied. Total rules applied 274 place count 791 transition count 903
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 295 place count 770 transition count 882
Iterating global reduction 0 with 21 rules applied. Total rules applied 316 place count 770 transition count 882
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 334 place count 752 transition count 864
Iterating global reduction 0 with 18 rules applied. Total rules applied 352 place count 752 transition count 864
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 370 place count 734 transition count 846
Iterating global reduction 0 with 18 rules applied. Total rules applied 388 place count 734 transition count 846
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 405 place count 717 transition count 829
Iterating global reduction 0 with 17 rules applied. Total rules applied 422 place count 717 transition count 829
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 439 place count 700 transition count 812
Iterating global reduction 0 with 17 rules applied. Total rules applied 456 place count 700 transition count 812
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 471 place count 685 transition count 797
Iterating global reduction 0 with 15 rules applied. Total rules applied 486 place count 685 transition count 797
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 497 place count 674 transition count 786
Iterating global reduction 0 with 11 rules applied. Total rules applied 508 place count 674 transition count 786
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 511 place count 674 transition count 783
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 515 place count 670 transition count 779
Iterating global reduction 1 with 4 rules applied. Total rules applied 519 place count 670 transition count 779
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 522 place count 667 transition count 776
Iterating global reduction 1 with 3 rules applied. Total rules applied 525 place count 667 transition count 776
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 527 place count 665 transition count 774
Iterating global reduction 1 with 2 rules applied. Total rules applied 529 place count 665 transition count 774
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 531 place count 663 transition count 772
Iterating global reduction 1 with 2 rules applied. Total rules applied 533 place count 663 transition count 772
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 535 place count 661 transition count 770
Iterating global reduction 1 with 2 rules applied. Total rules applied 537 place count 661 transition count 770
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 539 place count 659 transition count 768
Iterating global reduction 1 with 2 rules applied. Total rules applied 541 place count 659 transition count 768
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 543 place count 657 transition count 766
Iterating global reduction 1 with 2 rules applied. Total rules applied 545 place count 657 transition count 766
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 547 place count 655 transition count 764
Iterating global reduction 1 with 2 rules applied. Total rules applied 549 place count 655 transition count 764
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 551 place count 653 transition count 762
Iterating global reduction 1 with 2 rules applied. Total rules applied 553 place count 653 transition count 762
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 555 place count 651 transition count 760
Iterating global reduction 1 with 2 rules applied. Total rules applied 557 place count 651 transition count 760
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 559 place count 649 transition count 758
Iterating global reduction 1 with 2 rules applied. Total rules applied 561 place count 649 transition count 758
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 562 place count 648 transition count 757
Iterating global reduction 1 with 1 rules applied. Total rules applied 563 place count 648 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 564 place count 648 transition count 756
Applied a total of 564 rules in 898 ms. Remains 648 /928 variables (removed 280) and now considering 756/1040 (removed 284) transitions.
// Phase 1: matrix 756 rows 648 cols
[2024-06-01 07:48:44] [INFO ] Computed 4 invariants in 25 ms
[2024-06-01 07:48:45] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 07:48:45] [INFO ] Invariant cache hit.
[2024-06-01 07:48:45] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 755 sub problems to find dead transitions.
[2024-06-01 07:48:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (OVERLAPS) 1/648 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 755 unsolved
[2024-06-01 07:48:59] [INFO ] Deduced a trap composed of 298 places in 234 ms of which 38 ms to minimize.
[2024-06-01 07:48:59] [INFO ] Deduced a trap composed of 302 places in 178 ms of which 8 ms to minimize.
[2024-06-01 07:49:00] [INFO ] Deduced a trap composed of 292 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:49:00] [INFO ] Deduced a trap composed of 293 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:49:01] [INFO ] Deduced a trap composed of 333 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:49:03] [INFO ] Deduced a trap composed of 299 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:49:03] [INFO ] Deduced a trap composed of 298 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:49:04] [INFO ] Deduced a trap composed of 332 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:49:05] [INFO ] Deduced a trap composed of 362 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:49:09] [INFO ] Deduced a trap composed of 331 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:49:10] [INFO ] Deduced a trap composed of 305 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:49:10] [INFO ] Deduced a trap composed of 305 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:49:10] [INFO ] Deduced a trap composed of 304 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/648 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/1404 variables, and 17 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/648 constraints, PredecessorRefiner: 755/755 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 1 (OVERLAPS) 1/648 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 755 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/648 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 755 unsolved
[2024-06-01 07:49:26] [INFO ] Deduced a trap composed of 302 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:49:31] [INFO ] Deduced a trap composed of 335 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/648 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 755 unsolved
[2024-06-01 07:49:41] [INFO ] Deduced a trap composed of 294 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 755 unsolved
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 Int declared 648/1404 variables, and 20 constraints, problems are : Problem set: 0 solved, 755 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/648 constraints, PredecessorRefiner: 0/755 constraints, Known Traps: 16/16 constraints]
After SMT, in 60264ms problems are : Problem set: 0 solved, 755 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Starting structural reductions in LTL mode, iteration 1 : 648/928 places, 756/1040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62052 ms. Remains : 648/928 places, 756/1040 transitions.
Support contains 27 out of 648 places after structural reductions.
[2024-06-01 07:49:46] [INFO ] Flatten gal took : 82 ms
[2024-06-01 07:49:46] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:49:46] [INFO ] Input system was already deterministic with 756 transitions.
RANDOM walk for 40000 steps (654 resets) in 2023 ms. (19 steps per ms) remains 8/18 properties
BEST_FIRST walk for 40002 steps (163 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (164 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (124 resets) in 159 ms. (250 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (161 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (165 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (162 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (157 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
[2024-06-01 07:49:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 432/441 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:49:47] [INFO ] Deduced a trap composed of 333 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:49:47] [INFO ] Deduced a trap composed of 305 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:49:48] [INFO ] Deduced a trap composed of 334 places in 111 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 207/648 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 756/1404 variables, 648/655 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:49:48] [INFO ] Deduced a trap composed of 299 places in 200 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1404 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1404 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1404 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1404/1404 variables, and 656 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 648/648 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 432/441 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 207/648 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:49:49] [INFO ] Deduced a trap composed of 332 places in 144 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 756/1404 variables, 648/657 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1404 variables, 7/664 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:49:50] [INFO ] Deduced a trap composed of 304 places in 133 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1404 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1404 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/1404 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1404/1404 variables, and 665 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1684 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 648/648 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 3762ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 1471 ms.
Support contains 8 out of 648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 648/648 places, 756/756 transitions.
Graph (trivial) has 631 edges and 648 vertex of which 51 / 648 are part of one of the 9 SCC in 4 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 884 edges and 606 vertex of which 603 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 448 rules applied. Total rules applied 450 place count 603 transition count 251
Reduce places removed 445 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 454 rules applied. Total rules applied 904 place count 158 transition count 242
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 912 place count 154 transition count 238
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 916 place count 150 transition count 238
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 916 place count 150 transition count 201
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 990 place count 113 transition count 201
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 991 place count 112 transition count 200
Iterating global reduction 4 with 1 rules applied. Total rules applied 992 place count 112 transition count 200
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 993 place count 111 transition count 199
Iterating global reduction 4 with 1 rules applied. Total rules applied 994 place count 111 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 995 place count 111 transition count 198
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1037 place count 90 transition count 177
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1044 place count 90 transition count 170
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1061 place count 73 transition count 116
Iterating global reduction 6 with 17 rules applied. Total rules applied 1078 place count 73 transition count 116
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1085 place count 73 transition count 109
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1092 place count 66 transition count 102
Iterating global reduction 7 with 7 rules applied. Total rules applied 1099 place count 66 transition count 102
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1103 place count 62 transition count 98
Iterating global reduction 7 with 4 rules applied. Total rules applied 1107 place count 62 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1108 place count 62 transition count 97
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1114 place count 59 transition count 94
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1120 place count 56 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1121 place count 56 transition count 114
Free-agglomeration rule applied 16 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1137 place count 56 transition count 95
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1159 place count 40 transition count 89
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1162 place count 37 transition count 86
Iterating global reduction 9 with 3 rules applied. Total rules applied 1165 place count 37 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1166 place count 37 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1168 place count 36 transition count 102
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1180 place count 36 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 1191 place count 36 transition count 79
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1193 place count 36 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1194 place count 36 transition count 78
Applied a total of 1194 rules in 80 ms. Remains 36 /648 variables (removed 612) and now considering 78/756 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 36/648 places, 78/756 transitions.
RANDOM walk for 16728 steps (4 resets) in 204 ms. (81 steps per ms) remains 0/6 properties
Computed a total of 132 stabilizing places and 138 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G((F(p2)||p1))))'
Support contains 6 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Graph (trivial) has 634 edges and 648 vertex of which 51 / 648 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 443 place count 605 transition count 265
Reduce places removed 442 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 452 rules applied. Total rules applied 895 place count 163 transition count 255
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 902 place count 159 transition count 252
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 905 place count 156 transition count 252
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 905 place count 156 transition count 220
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 969 place count 124 transition count 220
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 973 place count 120 transition count 216
Iterating global reduction 4 with 4 rules applied. Total rules applied 977 place count 120 transition count 216
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 978 place count 119 transition count 215
Iterating global reduction 4 with 1 rules applied. Total rules applied 979 place count 119 transition count 215
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 980 place count 118 transition count 214
Iterating global reduction 4 with 1 rules applied. Total rules applied 981 place count 118 transition count 214
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 982 place count 117 transition count 213
Iterating global reduction 4 with 1 rules applied. Total rules applied 983 place count 117 transition count 213
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1029 place count 94 transition count 189
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1046 place count 77 transition count 137
Iterating global reduction 4 with 17 rules applied. Total rules applied 1063 place count 77 transition count 137
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1068 place count 77 transition count 132
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1077 place count 68 transition count 120
Iterating global reduction 5 with 9 rules applied. Total rules applied 1086 place count 68 transition count 120
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1095 place count 59 transition count 108
Iterating global reduction 5 with 9 rules applied. Total rules applied 1104 place count 59 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1107 place count 59 transition count 105
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1121 place count 52 transition count 120
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1122 place count 51 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 1123 place count 51 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1124 place count 51 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1127 place count 51 transition count 110
Applied a total of 1127 rules in 57 ms. Remains 51 /648 variables (removed 597) and now considering 110/756 (removed 646) transitions.
[2024-06-01 07:49:52] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
// Phase 1: matrix 106 rows 51 cols
[2024-06-01 07:49:52] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:49:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 07:49:53] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2024-06-01 07:49:53] [INFO ] Invariant cache hit.
[2024-06-01 07:49:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 07:49:53] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-06-01 07:49:53] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 07:49:53] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2024-06-01 07:49:53] [INFO ] Invariant cache hit.
[2024-06-01 07:49:53] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 105/156 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:49:54] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 82 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2785 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 105/156 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 97/178 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:49:56] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:49:57] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/157 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/157 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 181 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 12/12 constraints]
After SMT, in 6671ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 6672ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/648 places, 110/756 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6826 ms. Remains : 51/648 places, 110/756 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-03
Product exploration explored 100000 steps with 740 reset in 153 ms.
Product exploration explored 100000 steps with 132 reset in 85 ms.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 15 factoid took 315 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (5740 resets) in 408 ms. (97 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (872 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
[2024-06-01 07:50:00] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2024-06-01 07:50:00] [INFO ] Invariant cache hit.
[2024-06-01 07:50:00] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/153 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/156 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:50:00] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 153/157 variables, and 51 constraints, problems are : Problem set: 1 solved, 0 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 49/51 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 152ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (G (OR p2 p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT p2)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-03 finished in 8121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&(p1 U (p2||G(p1)))))))'
Support contains 5 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Graph (trivial) has 636 edges and 648 vertex of which 51 / 648 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 443 place count 605 transition count 265
Reduce places removed 442 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 452 rules applied. Total rules applied 895 place count 163 transition count 255
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 903 place count 159 transition count 251
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 907 place count 155 transition count 251
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 907 place count 155 transition count 218
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 973 place count 122 transition count 218
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 979 place count 116 transition count 212
Iterating global reduction 4 with 6 rules applied. Total rules applied 985 place count 116 transition count 212
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 987 place count 114 transition count 210
Iterating global reduction 4 with 2 rules applied. Total rules applied 989 place count 114 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 990 place count 114 transition count 209
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 991 place count 113 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 992 place count 113 transition count 208
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 993 place count 112 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 994 place count 112 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 995 place count 112 transition count 206
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1037 place count 91 transition count 184
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1054 place count 74 transition count 132
Iterating global reduction 6 with 17 rules applied. Total rules applied 1071 place count 74 transition count 132
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1078 place count 74 transition count 125
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1086 place count 66 transition count 114
Iterating global reduction 7 with 8 rules applied. Total rules applied 1094 place count 66 transition count 114
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1102 place count 58 transition count 103
Iterating global reduction 7 with 8 rules applied. Total rules applied 1110 place count 58 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1112 place count 58 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1126 place count 51 transition count 113
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1127 place count 50 transition count 107
Iterating global reduction 8 with 1 rules applied. Total rules applied 1128 place count 50 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1129 place count 50 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1132 place count 50 transition count 103
Applied a total of 1132 rules in 49 ms. Remains 50 /648 variables (removed 598) and now considering 103/756 (removed 653) transitions.
[2024-06-01 07:50:01] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
// Phase 1: matrix 99 rows 50 cols
[2024-06-01 07:50:01] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:50:01] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 07:50:01] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:01] [INFO ] Invariant cache hit.
[2024-06-01 07:50:01] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 07:50:01] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-06-01 07:50:01] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-01 07:50:01] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:01] [INFO ] Invariant cache hit.
[2024-06-01 07:50:01] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:50:02] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:02] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:02] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 98/148 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 1/149 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 0/149 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 81 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2630 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 98/148 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 94/174 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:04] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 1/149 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 0/149 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 177 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 12/12 constraints]
After SMT, in 6819ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 6820ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/648 places, 103/756 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7104 ms. Remains : 50/648 places, 103/756 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-04
Product exploration explored 100000 steps with 219 reset in 67 ms.
Product exploration explored 100000 steps with 699 reset in 110 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 143 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (5832 resets) in 85 ms. (465 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (939 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
[2024-06-01 07:50:08] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:08] [INFO ] Invariant cache hit.
[2024-06-01 07:50:08] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/145 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/148 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/149 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/149 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:50:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:50:08] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 145/149 variables, and 51 constraints, problems are : Problem set: 1 solved, 0 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 48/50 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 160ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1)), (G (OR p1 p2 p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (NOT (OR p1 p2))), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 291 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 07:50:09] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:09] [INFO ] Invariant cache hit.
[2024-06-01 07:50:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 07:50:09] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:09] [INFO ] Invariant cache hit.
[2024-06-01 07:50:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 07:50:09] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 07:50:09] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-01 07:50:09] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:09] [INFO ] Invariant cache hit.
[2024-06-01 07:50:09] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:09] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:50:09] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:50:09] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:50:09] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:50:09] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:50:10] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:50:10] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:50:10] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:10] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:10] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 98/148 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 1/149 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 0/149 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 81 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2610 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 98/148 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 94/174 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:13] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:13] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 1/149 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 0/149 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 177 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 12/12 constraints]
After SMT, in 6768ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 6769ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6866 ms. Remains : 50/50 places, 103/103 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (5809 resets) in 70 ms. (563 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (924 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-06-01 07:50:16] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:16] [INFO ] Invariant cache hit.
[2024-06-01 07:50:16] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/145 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/148 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/149 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/149 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:50:16] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:50:16] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 145/149 variables, and 51 constraints, problems are : Problem set: 1 solved, 0 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 48/50 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 158ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (G (OR p1 p2 p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (NOT (OR p1 p2))), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 292 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 586 reset in 54 ms.
Product exploration explored 100000 steps with 1702 reset in 57 ms.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 07:50:17] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:17] [INFO ] Invariant cache hit.
[2024-06-01 07:50:17] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 07:50:17] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:17] [INFO ] Invariant cache hit.
[2024-06-01 07:50:17] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 07:50:17] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-06-01 07:50:17] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-01 07:50:17] [INFO ] Flow matrix only has 99 transitions (discarded 4 similar events)
[2024-06-01 07:50:17] [INFO ] Invariant cache hit.
[2024-06-01 07:50:17] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:17] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:50:17] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 98/148 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 1/149 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 0/149 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 81 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 98/148 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 94/174 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:21] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 07:50:21] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 1/149 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 0/149 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 177 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 12/12 constraints]
After SMT, in 6806ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 6807ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6934 ms. Remains : 50/50 places, 103/103 transitions.
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-04 finished in 23544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(p1))))'
Support contains 2 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 639 transition count 747
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 639 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 639 transition count 746
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 632 transition count 739
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 632 transition count 739
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 627 transition count 734
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 627 transition count 734
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 624 transition count 731
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 624 transition count 731
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 621 transition count 728
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 621 transition count 728
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 618 transition count 725
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 618 transition count 725
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 615 transition count 722
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 615 transition count 722
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 612 transition count 719
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 612 transition count 719
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 609 transition count 716
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 608 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 604 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 603 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 601 transition count 708
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 600 transition count 707
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 599 transition count 706
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 598 transition count 705
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 597 transition count 704
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 596 transition count 703
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 596 transition count 702
Applied a total of 106 rules in 230 ms. Remains 596 /648 variables (removed 52) and now considering 702/756 (removed 54) transitions.
// Phase 1: matrix 702 rows 596 cols
[2024-06-01 07:50:24] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 07:50:24] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 07:50:24] [INFO ] Invariant cache hit.
[2024-06-01 07:50:25] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 701 sub problems to find dead transitions.
[2024-06-01 07:50:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-06-01 07:50:39] [INFO ] Deduced a trap composed of 290 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:50:39] [INFO ] Deduced a trap composed of 290 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:50:41] [INFO ] Deduced a trap composed of 292 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:50:44] [INFO ] Deduced a trap composed of 298 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:50:44] [INFO ] Deduced a trap composed of 292 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:50:44] [INFO ] Deduced a trap composed of 298 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:50:44] [INFO ] Deduced a trap composed of 291 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:50:44] [INFO ] Deduced a trap composed of 292 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:50:45] [INFO ] Deduced a trap composed of 292 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:50:45] [INFO ] Deduced a trap composed of 297 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:50:45] [INFO ] Deduced a trap composed of 297 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:50:46] [INFO ] Deduced a trap composed of 298 places in 149 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-06-01 07:50:48] [INFO ] Deduced a trap composed of 292 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:50:52] [INFO ] Deduced a trap composed of 291 places in 113 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1298 variables, and 18 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 702/1298 variables, 596/614 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1298 variables, 701/1315 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-06-01 07:51:18] [INFO ] Deduced a trap composed of 298 places in 142 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1298/1298 variables, and 1316 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 596/596 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 15/15 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 596/648 places, 702/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60803 ms. Remains : 596/648 places, 702/756 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-05
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 4 ms.
FORMULA StigmergyCommit-PT-02b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-05 finished in 60973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Graph (trivial) has 644 edges and 648 vertex of which 51 / 648 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 453 transitions
Trivial Post-agglo rules discarded 453 transitions
Performed 453 trivial Post agglomeration. Transition count delta: 453
Iterating post reduction 0 with 453 rules applied. Total rules applied 454 place count 605 transition count 254
Reduce places removed 453 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 463 rules applied. Total rules applied 917 place count 152 transition count 244
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 922 place count 148 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 923 place count 147 transition count 243
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 923 place count 147 transition count 211
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 987 place count 115 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 993 place count 109 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 999 place count 109 transition count 205
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1001 place count 107 transition count 203
Iterating global reduction 4 with 2 rules applied. Total rules applied 1003 place count 107 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1004 place count 107 transition count 202
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1005 place count 106 transition count 201
Iterating global reduction 5 with 1 rules applied. Total rules applied 1006 place count 106 transition count 201
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1007 place count 105 transition count 200
Iterating global reduction 5 with 1 rules applied. Total rules applied 1008 place count 105 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1009 place count 105 transition count 199
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 1055 place count 82 transition count 175
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1072 place count 65 transition count 123
Iterating global reduction 6 with 17 rules applied. Total rules applied 1089 place count 65 transition count 123
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1097 place count 65 transition count 115
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1106 place count 56 transition count 103
Iterating global reduction 7 with 9 rules applied. Total rules applied 1115 place count 56 transition count 103
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1124 place count 47 transition count 91
Iterating global reduction 7 with 9 rules applied. Total rules applied 1133 place count 47 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1136 place count 47 transition count 88
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1148 place count 41 transition count 95
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1149 place count 40 transition count 89
Iterating global reduction 8 with 1 rules applied. Total rules applied 1150 place count 40 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1151 place count 40 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1154 place count 40 transition count 85
Applied a total of 1154 rules in 31 ms. Remains 40 /648 variables (removed 608) and now considering 85/756 (removed 671) transitions.
[2024-06-01 07:51:25] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 40 cols
[2024-06-01 07:51:25] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 07:51:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 07:51:25] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 07:51:25] [INFO ] Invariant cache hit.
[2024-06-01 07:51:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 07:51:25] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 07:51:25] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 07:51:25] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 07:51:25] [INFO ] Invariant cache hit.
[2024-06-01 07:51:25] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:25] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:51:25] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:51:25] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:51:25] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:51:26] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:51:26] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:51:26] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:51:26] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 80/120 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:26] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/121 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 67 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:27] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:51:27] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 80/120 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 80/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/121 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 150 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2818 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 12/12 constraints]
After SMT, in 4692ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4693ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/648 places, 85/756 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4815 ms. Remains : 40/648 places, 85/756 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-06
Product exploration explored 100000 steps with 197 reset in 75 ms.
Product exploration explored 100000 steps with 194 reset in 67 ms.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Detected a total of 2/40 stabilizing places and 6/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 85/85 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-01 07:51:30] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 07:51:30] [INFO ] Invariant cache hit.
[2024-06-01 07:51:31] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 07:51:31] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 07:51:31] [INFO ] Invariant cache hit.
[2024-06-01 07:51:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 07:51:31] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-01 07:51:31] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 07:51:31] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 07:51:31] [INFO ] Invariant cache hit.
[2024-06-01 07:51:31] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 80/120 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/121 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 67 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:33] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:51:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 80/120 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 80/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:34] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/121 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 150 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2861 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 12/12 constraints]
After SMT, in 4835ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4836ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4937 ms. Remains : 40/40 places, 85/85 transitions.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Detected a total of 2/40 stabilizing places and 6/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 489 reset in 51 ms.
Product exploration explored 100000 steps with 108 reset in 157 ms.
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-01 07:51:36] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 07:51:36] [INFO ] Invariant cache hit.
[2024-06-01 07:51:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 07:51:36] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 07:51:36] [INFO ] Invariant cache hit.
[2024-06-01 07:51:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 07:51:36] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-01 07:51:36] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 07:51:36] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 07:51:36] [INFO ] Invariant cache hit.
[2024-06-01 07:51:36] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 80/120 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/121 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 67 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1956 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:38] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:51:38] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 80/120 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 80/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:51:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/121 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 150 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2793 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 12/12 constraints]
After SMT, in 4782ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4784ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4880 ms. Remains : 40/40 places, 85/85 transitions.
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-06 finished in 16065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 640 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 640 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 640 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 634 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 634 transition count 741
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 630 transition count 737
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 630 transition count 737
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 627 transition count 734
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 627 transition count 734
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 624 transition count 731
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 624 transition count 731
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 621 transition count 728
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 621 transition count 728
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 618 transition count 725
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 618 transition count 725
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 615 transition count 722
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 615 transition count 722
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 612 transition count 719
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 612 transition count 719
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 611 transition count 718
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 611 transition count 718
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 610 transition count 717
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 610 transition count 717
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 609 transition count 716
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 608 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 604 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 603 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 601 transition count 708
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 600 transition count 707
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 599 transition count 706
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 599 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 599 transition count 705
Applied a total of 100 rules in 229 ms. Remains 599 /648 variables (removed 49) and now considering 705/756 (removed 51) transitions.
// Phase 1: matrix 705 rows 599 cols
[2024-06-01 07:51:41] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 07:51:41] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 07:51:41] [INFO ] Invariant cache hit.
[2024-06-01 07:51:42] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 704 sub problems to find dead transitions.
[2024-06-01 07:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/599 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-06-01 07:51:56] [INFO ] Deduced a trap composed of 297 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:51:57] [INFO ] Deduced a trap composed of 291 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:51:58] [INFO ] Deduced a trap composed of 297 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:51:58] [INFO ] Deduced a trap composed of 292 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:51:59] [INFO ] Deduced a trap composed of 292 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:51:59] [INFO ] Deduced a trap composed of 291 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:51:59] [INFO ] Deduced a trap composed of 297 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:52:00] [INFO ] Deduced a trap composed of 291 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:52:01] [INFO ] Deduced a trap composed of 293 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:52:01] [INFO ] Deduced a trap composed of 292 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:52:02] [INFO ] Deduced a trap composed of 291 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:52:03] [INFO ] Deduced a trap composed of 301 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:52:03] [INFO ] Deduced a trap composed of 298 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:52:03] [INFO ] Deduced a trap composed of 298 places in 143 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/1304 variables, and 18 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/599 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 704 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/599 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/599 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 4 (OVERLAPS) 705/1304 variables, 599/617 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1304 variables, 704/1321 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 1321 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 599/599 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 14/14 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 599/648 places, 705/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60784 ms. Remains : 599/648 places, 705/756 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 4200 steps with 68 reset in 6 ms.
FORMULA StigmergyCommit-PT-02b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-07 finished in 60885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 640 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 640 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 640 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 634 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 634 transition count 741
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 630 transition count 737
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 630 transition count 737
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 628 transition count 735
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 628 transition count 735
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 627 transition count 734
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 627 transition count 734
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 626 transition count 733
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 626 transition count 733
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 625 transition count 732
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 625 transition count 732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 624 transition count 731
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 624 transition count 731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 623 transition count 730
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 623 transition count 730
Applied a total of 51 rules in 111 ms. Remains 623 /648 variables (removed 25) and now considering 730/756 (removed 26) transitions.
// Phase 1: matrix 730 rows 623 cols
[2024-06-01 07:52:42] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 07:52:42] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 07:52:42] [INFO ] Invariant cache hit.
[2024-06-01 07:52:43] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 729 sub problems to find dead transitions.
[2024-06-01 07:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-01 07:52:55] [INFO ] Deduced a trap composed of 291 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:52:55] [INFO ] Deduced a trap composed of 298 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:52:55] [INFO ] Deduced a trap composed of 298 places in 127 ms of which 4 ms to minimize.
[2024-06-01 07:52:56] [INFO ] Deduced a trap composed of 324 places in 171 ms of which 4 ms to minimize.
[2024-06-01 07:52:56] [INFO ] Deduced a trap composed of 292 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 297 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 292 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 298 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:52:59] [INFO ] Deduced a trap composed of 290 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:53:04] [INFO ] Deduced a trap composed of 324 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:53:04] [INFO ] Deduced a trap composed of 319 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:53:05] [INFO ] Deduced a trap composed of 298 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:53:05] [INFO ] Deduced a trap composed of 291 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:53:07] [INFO ] Deduced a trap composed of 292 places in 133 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-06-01 07:53:13] [INFO ] Deduced a trap composed of 291 places in 132 ms of which 3 ms to minimize.
SMT process timed out in 30233ms, After SMT, problems are : Problem set: 0 solved, 729 unsolved
Search for dead transitions found 0 dead transitions in 30242ms
Starting structural reductions in LTL mode, iteration 1 : 623/648 places, 730/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30775 ms. Remains : 623/648 places, 730/756 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-09
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-09 finished in 30968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 640 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 640 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 640 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 634 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 634 transition count 741
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 630 transition count 737
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 630 transition count 737
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 628 transition count 735
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 628 transition count 735
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 626 transition count 733
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 626 transition count 733
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 624 transition count 731
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 624 transition count 731
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 622 transition count 729
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 622 transition count 729
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 620 transition count 727
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 620 transition count 727
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 618 transition count 725
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 618 transition count 725
Applied a total of 61 rules in 116 ms. Remains 618 /648 variables (removed 30) and now considering 725/756 (removed 31) transitions.
// Phase 1: matrix 725 rows 618 cols
[2024-06-01 07:53:13] [INFO ] Computed 4 invariants in 7 ms
[2024-06-01 07:53:13] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 07:53:13] [INFO ] Invariant cache hit.
[2024-06-01 07:53:13] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2024-06-01 07:53:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/618 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-01 07:53:26] [INFO ] Deduced a trap composed of 298 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:53:26] [INFO ] Deduced a trap composed of 290 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:53:26] [INFO ] Deduced a trap composed of 291 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:53:26] [INFO ] Deduced a trap composed of 298 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:53:27] [INFO ] Deduced a trap composed of 291 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:53:27] [INFO ] Deduced a trap composed of 291 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:53:28] [INFO ] Deduced a trap composed of 319 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:53:29] [INFO ] Deduced a trap composed of 297 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 292 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:53:34] [INFO ] Deduced a trap composed of 298 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:53:35] [INFO ] Deduced a trap composed of 314 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:53:35] [INFO ] Deduced a trap composed of 313 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:53:36] [INFO ] Deduced a trap composed of 319 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:53:36] [INFO ] Deduced a trap composed of 297 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:53:36] [INFO ] Deduced a trap composed of 292 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:53:36] [INFO ] Deduced a trap composed of 314 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:53:37] [INFO ] Deduced a trap composed of 298 places in 148 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1343 variables, and 21 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/618 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/618 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 290 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 320 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (OVERLAPS) 725/1343 variables, 618/641 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1343 variables, 724/1365 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1343/1343 variables, and 1365 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 618/618 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 19/19 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 618/648 places, 725/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 618/648 places, 725/756 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-10 finished in 60809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 640 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 640 transition count 748
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 633 transition count 741
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 633 transition count 741
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 628 transition count 736
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 628 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 625 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 625 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 622 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 622 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 619 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 619 transition count 727
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 616 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 616 transition count 724
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 613 transition count 721
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 613 transition count 721
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 610 transition count 718
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 610 transition count 718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 609 transition count 717
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 609 transition count 717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 608 transition count 716
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 607 transition count 715
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 607 transition count 715
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 606 transition count 714
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 606 transition count 714
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 605 transition count 713
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 604 transition count 712
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 604 transition count 712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 603 transition count 711
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 603 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 602 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 602 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 601 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 601 transition count 709
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 600 transition count 708
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 600 transition count 708
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 599 transition count 707
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 599 transition count 707
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 598 transition count 706
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 598 transition count 706
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 597 transition count 705
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 597 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 597 transition count 704
Applied a total of 103 rules in 220 ms. Remains 597 /648 variables (removed 51) and now considering 704/756 (removed 52) transitions.
// Phase 1: matrix 704 rows 597 cols
[2024-06-01 07:54:14] [INFO ] Computed 4 invariants in 7 ms
[2024-06-01 07:54:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 07:54:14] [INFO ] Invariant cache hit.
[2024-06-01 07:54:14] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2024-06-01 07:54:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-01 07:54:28] [INFO ] Deduced a trap composed of 291 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:54:28] [INFO ] Deduced a trap composed of 291 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:54:31] [INFO ] Deduced a trap composed of 292 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 297 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 299 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 292 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 298 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 291 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 292 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 291 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 297 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 299 places in 138 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-01 07:54:37] [INFO ] Deduced a trap composed of 292 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:54:41] [INFO ] Deduced a trap composed of 292 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 291 places in 109 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/1301 variables, and 19 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 298 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 292 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (OVERLAPS) 704/1301 variables, 597/618 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1301 variables, 703/1321 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 1321 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 17/17 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 597/648 places, 704/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60808 ms. Remains : 597/648 places, 704/756 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-11 finished in 60994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1)&&F(p2)) U X(X(p0)))))'
Support contains 4 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 640 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 640 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 640 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 634 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 634 transition count 741
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 629 transition count 736
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 629 transition count 736
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 626 transition count 733
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 626 transition count 733
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 623 transition count 730
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 623 transition count 730
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 620 transition count 727
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 620 transition count 727
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 617 transition count 724
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 617 transition count 724
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 614 transition count 721
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 614 transition count 721
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 611 transition count 718
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 611 transition count 718
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 610 transition count 717
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 610 transition count 717
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 609 transition count 716
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 608 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 604 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 603 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 602 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 601 transition count 708
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 600 transition count 707
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 599 transition count 706
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 598 transition count 705
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 598 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 598 transition count 704
Applied a total of 102 rules in 227 ms. Remains 598 /648 variables (removed 50) and now considering 704/756 (removed 52) transitions.
// Phase 1: matrix 704 rows 598 cols
[2024-06-01 07:55:15] [INFO ] Computed 4 invariants in 9 ms
[2024-06-01 07:55:15] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 07:55:15] [INFO ] Invariant cache hit.
[2024-06-01 07:55:15] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2024-06-01 07:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-01 07:55:30] [INFO ] Deduced a trap composed of 292 places in 156 ms of which 4 ms to minimize.
[2024-06-01 07:55:30] [INFO ] Deduced a trap composed of 291 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:55:30] [INFO ] Deduced a trap composed of 300 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:55:32] [INFO ] Deduced a trap composed of 292 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 297 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 292 places in 143 ms of which 4 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 299 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 298 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 298 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 294 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 298 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 298 places in 143 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-01 07:55:39] [INFO ] Deduced a trap composed of 294 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:55:39] [INFO ] Deduced a trap composed of 294 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 291 places in 120 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 598/1302 variables, and 19 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/598 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (OVERLAPS) 704/1302 variables, 598/617 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1302 variables, 703/1320 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1302/1302 variables, and 1320 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 598/598 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 15/15 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 598/648 places, 704/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60790 ms. Remains : 598/648 places, 704/756 transitions.
Stuttering acceptance computed with spot in 541 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-14 finished in 61365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 756/756 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 640 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 640 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 640 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 634 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 634 transition count 741
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 630 transition count 737
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 630 transition count 737
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 628 transition count 735
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 628 transition count 735
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 626 transition count 733
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 626 transition count 733
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 624 transition count 731
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 624 transition count 731
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 622 transition count 729
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 622 transition count 729
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 620 transition count 727
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 620 transition count 727
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 618 transition count 725
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 618 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 617 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 617 transition count 724
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 616 transition count 723
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 616 transition count 723
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 615 transition count 722
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 615 transition count 722
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 614 transition count 721
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 614 transition count 721
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 613 transition count 720
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 613 transition count 720
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 612 transition count 719
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 612 transition count 719
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 611 transition count 718
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 611 transition count 718
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 610 transition count 717
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 610 transition count 717
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 609 transition count 716
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 608 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 607 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 606 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 605 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 605 transition count 712
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 605 transition count 711
Applied a total of 88 rules in 214 ms. Remains 605 /648 variables (removed 43) and now considering 711/756 (removed 45) transitions.
// Phase 1: matrix 711 rows 605 cols
[2024-06-01 07:56:16] [INFO ] Computed 4 invariants in 14 ms
[2024-06-01 07:56:16] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 07:56:16] [INFO ] Invariant cache hit.
[2024-06-01 07:56:17] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-06-01 07:56:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (OVERLAPS) 1/605 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 710 unsolved
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 297 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 297 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 291 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 298 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 297 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:56:29] [INFO ] Deduced a trap composed of 292 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 300 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:56:32] [INFO ] Deduced a trap composed of 298 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 300 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 297 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:56:33] [INFO ] Deduced a trap composed of 290 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:56:34] [INFO ] Deduced a trap composed of 298 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:56:35] [INFO ] Deduced a trap composed of 338 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:56:37] [INFO ] Deduced a trap composed of 291 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:56:38] [INFO ] Deduced a trap composed of 300 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:56:38] [INFO ] Deduced a trap composed of 301 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:56:39] [INFO ] Deduced a trap composed of 396 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:56:39] [INFO ] Deduced a trap composed of 299 places in 132 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 710 unsolved
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 605/1316 variables, and 22 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/605 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (OVERLAPS) 1/605 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 710 unsolved
[2024-06-01 07:56:54] [INFO ] Deduced a trap composed of 292 places in 124 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/605 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 710 unsolved
[2024-06-01 07:57:06] [INFO ] Deduced a trap composed of 299 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/605 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/1316 variables, and 24 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/605 constraints, PredecessorRefiner: 0/710 constraints, Known Traps: 20/20 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 605/648 places, 711/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60796 ms. Remains : 605/648 places, 711/756 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLCardinality-15
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLCardinality-15 finished in 60931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&(p1 U (p2||G(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 07:57:17] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:57:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 07:57:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 648 places, 756 transitions and 1855 arcs took 8 ms.
Total runtime 514461 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-02b-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-02b-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717229740989

--------------------
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 StigmergyCommit-PT-02b-LTLCardinality-04
ltl formula formula --ltl=/tmp/1905/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 648 places, 756 transitions and 1855 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1905/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1905/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1905/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1905/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 650 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 649, there are 796 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): ~139 levels ~10000 states ~23924 transitions
pnml2lts-mc( 1/ 4): ~139 levels ~20000 states ~50576 transitions
pnml2lts-mc( 1/ 4): ~139 levels ~40000 states ~108748 transitions
pnml2lts-mc( 1/ 4): ~146 levels ~80000 states ~216464 transitions
pnml2lts-mc( 1/ 4): ~153 levels ~160000 states ~435500 transitions
pnml2lts-mc( 0/ 4): ~208 levels ~320000 states ~888228 transitions
pnml2lts-mc( 2/ 4): ~87 levels ~640000 states ~1807344 transitions
pnml2lts-mc( 2/ 4): ~740 levels ~1280000 states ~3844740 transitions
pnml2lts-mc( 2/ 4): ~1119 levels ~2560000 states ~8680636 transitions
pnml2lts-mc( 0/ 4): ~353 levels ~5120000 states ~19423940 transitions
pnml2lts-mc( 0/ 4): ~1265 levels ~10240000 states ~37902576 transitions
pnml2lts-mc( 0/ 4): ~1299 levels ~20480000 states ~79239300 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22336373
pnml2lts-mc( 0/ 4): unique states count: 33544288
pnml2lts-mc( 0/ 4): unique transitions count: 131824072
pnml2lts-mc( 0/ 4): - self-loop count: 2148
pnml2lts-mc( 0/ 4): - claim dead count: 72435491
pnml2lts-mc( 0/ 4): - claim found count: 25805980
pnml2lts-mc( 0/ 4): - claim success count: 33545349
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24792
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33545388 states 131828501 transitions, fanout: 3.930
pnml2lts-mc( 0/ 4): Total exploration time 551.200 sec (551.200 sec minimum, 551.200 sec on average)
pnml2lts-mc( 0/ 4): States per second: 60859, Transitions per second: 239166
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 278.8MB, 8.7 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/35.0%
pnml2lts-mc( 0/ 4): Stored 768 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 278.8MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-02b-LTLCardinality-06
ltl formula formula --ltl=/tmp/1905/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 648 places, 756 transitions and 1855 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1905/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1905/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1905/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1905/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 649 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 649, there are 762 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): ~85 levels ~10000 states ~19352 transitions
pnml2lts-mc( 1/ 4): ~85 levels ~20000 states ~38956 transitions
pnml2lts-mc( 3/ 4): ~164 levels ~40000 states ~101208 transitions
pnml2lts-mc( 3/ 4): ~164 levels ~80000 states ~218692 transitions
pnml2lts-mc( 3/ 4): ~257 levels ~160000 states ~444168 transitions
pnml2lts-mc( 3/ 4): ~257 levels ~320000 states ~912212 transitions
pnml2lts-mc( 1/ 4): ~126 levels ~640000 states ~1772864 transitions
pnml2lts-mc( 1/ 4): ~126 levels ~1280000 states ~3580024 transitions
pnml2lts-mc( 1/ 4): ~246 levels ~2560000 states ~7984168 transitions
pnml2lts-mc( 0/ 4): ~2964 levels ~5120000 states ~17451744 transitions
pnml2lts-mc( 0/ 4): ~5099 levels ~10240000 states ~36794468 transitions
pnml2lts-mc( 0/ 4): ~5673 levels ~20480000 states ~78387828 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 21942832
pnml2lts-mc( 0/ 4): unique states count: 33544701
pnml2lts-mc( 0/ 4): unique transitions count: 131391373
pnml2lts-mc( 0/ 4): - self-loop count: 2177
pnml2lts-mc( 0/ 4): - claim dead count: 69992066
pnml2lts-mc( 0/ 4): - claim found count: 27837987
pnml2lts-mc( 0/ 4): - claim success count: 33553694
pnml2lts-mc( 0/ 4): - cum. max stack depth: 23206
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553765 states 131425123 transitions, fanout: 3.917
pnml2lts-mc( 0/ 4): Total exploration time 550.530 sec (550.510 sec minimum, 550.520 sec on average)
pnml2lts-mc( 0/ 4): States per second: 60948, Transitions per second: 238725
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 276.3MB, 8.6 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/31.0%
pnml2lts-mc( 0/ 4): Stored 768 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 276.3MB (~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="StigmergyCommit-PT-02b"
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 StigmergyCommit-PT-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690531600099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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